{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:57Z","timestamp":1725552477117},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_3","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"14-25","source":"Crossref","is-referenced-by-count":15,"title":["The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Backer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Mark","family":"Keil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","volume":"8","author":"A. Naamad","year":"1984","unstructured":"Naamad, A., Lee, D., Hsu, W.: Maximum empty rectangle problem. Discrete Appl. Math.\u00a08(3), 267\u2013277 (1984)","journal-title":"Discrete Appl. Math."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0215022","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Drysdale, R., Lee, D.: Computing the largest empty rectangle. SIAM J. Comput.\u00a015, 300 (1986)","journal-title":"SIAM J. Comput."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Suri, S.: Fast algorithms for computing the largest empty rectangle. In: Symposium on Computational Geometry, pp. 278\u2013290 (1987)","DOI":"10.1145\/41958.41988"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0898-1221(98)00125-4","volume":"36","author":"S. Nandy","year":"1998","unstructured":"Nandy, S., Bhattacharya, B.: Maximal empty cuboids among points and blocks. Computers and Mathematics with Applications\u00a036(3), 11\u201320 (1998)","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01840377","volume":"5","author":"M. Orlowski","year":"1990","unstructured":"Orlowski, M.: A new algorithm for the largest empty rectangle problem. Algorithmica\u00a05(1), 65\u201373 (1990)","journal-title":"Algorithmica"},{"issue":"1-2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0020-0255(00)00047-5","volume":"128","author":"A. Datta","year":"2000","unstructured":"Datta, A., Soundaralakshmi, S.: An efficient algorithm for computing the maximum empty rectangle in three dimensions. Inform. Sciences\u00a0128(1-2), 43\u201365 (2000)","journal-title":"Inform. Sciences"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1020546910706","volume":"23","author":"J. Eckstein","year":"2002","unstructured":"Eckstein, J., Hammer, P., Liu, Y., Nediak, M., Simeone, B.: The maximum box problem and its application to data analysis. Comput. Optim. Appl.\u00a023(3), 285\u2013298 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B. Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On Approximating the Depth and Related Problems. SIAM J. Comput.\u00a038(3), 899\u2013921 (2008)","journal-title":"SIAM J. Comput."},{"key":"3_CR9","unstructured":"Liu, Y., Nediak, M.: Planar case of the maximum box and related problems. In: CCCG, pp. 14\u201318 (2003)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0304-3975(02)00738-7","volume":"296","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty spaces in large data sets. Theor. Comput. Sci.\u00a0296(3), 435\u2013452 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1006\/jcss.1996.0034","volume":"52","author":"D. Dobkin","year":"1996","unstructured":"Dobkin, D., Gunopulos, D., Maass, W.: Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning. J. Comput. Syst. Sci.\u00a052(3), 453\u2013470 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G.N. Frederickson","year":"1984","unstructured":"Frederickson, G.N., Johnson, D.B.: Generalized selection and ranking: Sorted matrices. SIAM J. Comput.\u00a013(1), 14\u201330 (1984)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/0220065","volume":"20","author":"M. Overmars","year":"1991","unstructured":"Overmars, M., Yap, C.: New upper bounds in Klee\u2019s measure problem. SIAM J. Comput.\u00a020(6), 1034\u20131045 (1991)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/PL00009366","volume":"19","author":"J.D. Boissonnat","year":"1998","unstructured":"Boissonnat, J.D., Sharir, M., Tagansky, B., Yvinec, M.: Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete & Computational Geometry\u00a019(4), 485\u2013519 (1998)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR15","first-page":"785","volume-title":"SODA","author":"H. Kaplan","year":"2007","unstructured":"Kaplan, H., Rubin, N., Sharir, M., Verbin, E.: Counting colors in boxes. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 785\u2013794. SIAM, Philadelphia (2007)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1137\/0209017","volume":"9","author":"D.T. Lee","year":"1980","unstructured":"Lee, D.T., Wong, C.K.: Voronoi diagrams in l\n                1 (l\n                \u2009\u221e\u2009) metrics with 2-dimensional storage applications. SIAM J. Comput.\u00a09(1), 200\u2013211 (1980)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica\u00a02(1), 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"3_CR18","unstructured":"McKenna, M., O\u2019Rourke, J., Suri, S.: Finding the largest rectangle in an orthogonal polygon. In: Allerton Conference, pp. 486\u2013495 (1985)"},{"key":"3_CR19","unstructured":"Dumitrescu, A., Jiang, M.: On the largest empty axis-parallel box amidst n points. arxiv.org reference arXiv:0909.3127 (2009) Submitted for publication"},{"key":"3_CR20","first-page":"294","volume-title":"Symposium on Computational Geometry","author":"P.K. Agarwal","year":"2007","unstructured":"Agarwal, P.K., Kaplan, H., Sharir, M.: Computing the volume of the union of cubes. In: Erickson, J. (ed.) Symposium on Computational Geometry, pp. 294\u2013301. ACM, New York (2007)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:15:47Z","timestamp":1578507347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_3"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}