{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T10:45:11Z","timestamp":1763808311635},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0020-0255(00)00047-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"43-65","source":"Crossref","is-referenced-by-count":11,"title":["An efficient algorithm for computing the maximum empty rectangle in three dimensions"],"prefix":"10.1016","volume":"128","author":[{"given":"Amitava","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subbiah","family":"Soundaralakshmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(00)00047-5_BIB1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, S. Suri, Fast algorithms for computing the largest empty rectangle, in: Proceedings of the Third ACM Symposium on Computational Geometry, 1987, pp. 278\u2013290","DOI":"10.1145\/41958.41988"},{"key":"10.1016\/S0020-0255(00)00047-5_BIB2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(86)90071-5","article-title":"A note on finding the maximum empty rectangle","volume":"13","author":"Atallah","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0255(00)00047-5_BIB3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01553888","article-title":"An efficient algorithm for maxdominance, with applications","volume":"4","author":"Atallah","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0255(00)00047-5_BIB4","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/322092.322095","article-title":"On the average number of maxima in a set of vectors and applications","volume":"25","author":"Bentley","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0020-0255(00)00047-5_BIB5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","article-title":"Computing the largest empty rectangle","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(00)00047-5_BIB6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0255(92)90115-O","article-title":"Efficient algorithms for the largest rectangle problem","volume":"64","author":"Datta","year":"1992","journal-title":"Inform. Sci."},{"key":"10.1016\/S0020-0255(00)00047-5_BIB7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0196-6774(89)90011-4","article-title":"Fast algorithms for direct enclosures and direct dominances","volume":"10","author":"G\u00fcting","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0255(00)00047-5_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1080\/00207168608803518","article-title":"Direct dominance of points","volume":"19","author":"Klein","year":"1987","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0020-0255(00)00047-5_BIB9","unstructured":"M. Mckenna, J. O'Rourke, S. Suri, Finding the largest rectangle in an orthogonal polygon, in: Proceedings of the 23rd Annual Allerton Conference on Communication, Control and Computing, 1985"},{"key":"10.1016\/S0020-0255(00)00047-5_BIB10","series-title":"Multidimensional Searching and Computational Geometry","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/S0020-0255(00)00047-5_BIB11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","article-title":"On maximum empty rectangle problem","volume":"8","author":"Namaad","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0255(00)00047-5_BIB12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840377","article-title":"A new algorithm for the largest empty rectangle problem","volume":"5","author":"Orlowski","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0255(00)00047-5_BIB13","series-title":"Computational Geometry : An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025500000475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025500000475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T06:20:28Z","timestamp":1555827628000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025500000475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0020025500000475"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(00)00047-5","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}