{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:06:27Z","timestamp":1774893987198,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6041,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/0925-7721(95)00041-0","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"125-148","source":"Crossref","is-referenced-by-count":47,"title":["Finding the largest area axis-parallel rectangle in a polygon"],"prefix":"10.1016","volume":"7","author":[{"given":"Karen","family":"Daniels","sequence":"first","affiliation":[]},{"given":"Victor","family":"Milenkovic","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Roth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00041-0_BIB1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00041-0_BIB2","series-title":"Proc. 3rd ACM Symp. Comput. Geom.","first-page":"278","article-title":"Fast algorithms for computing the largest empty rectangle","author":"Aggarwal","year":"1987"},{"key":"10.1016\/0925-7721(95)00041-0_BIB3","series-title":"Fast algorithms for computing the largest empty rectangle","author":"Aggarwal","year":"1992"},{"key":"10.1016\/0925-7721(95)00041-0_BIB4","author":"Aggarwal","year":"1988","journal-title":"Computational Geometry Lecture Notes for MIT 18.409"},{"key":"10.1016\/0925-7721(95)00041-0_BIB5","series-title":"Proc. 10th ACM Symp. Comput. Geom.","first-page":"340","article-title":"Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem","author":"Amenta","year":"1994"},{"issue":"3","key":"10.1016\/0925-7721(95)00041-0_BIB6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams\u2014a survey of a fundamental geometric data structure","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/0925-7721(95)00041-0_BIB7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02187692","article-title":"A polynomial solution for the potato-peeling problem","volume":"1","author":"Chang","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00041-0_BIB8","series-title":"Proc. 23rd IEEE Symp. Found. Comp. Sci.","first-page":"339","article-title":"A theorem on polygon cutting with applications","author":"Chazelle","year":"1982"},{"key":"10.1016\/0925-7721(95)00041-0_BIB9","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\/0925-7721(95)00041-0_BIB10","series-title":"Proc. 1st ACM Symp. Comput. Geom.","first-page":"235","article-title":"Voronoi diagrams based on convex distance functions","author":"Chew","year":"1985"},{"key":"10.1016\/0925-7721(95)00041-0_BIB11","series-title":"Proc. 6th Canad. Conf. Comput. Geom.","first-page":"225","article-title":"Limited gaps","author":"Daniels","year":"1994"},{"key":"10.1016\/0925-7721(95)00041-0_BIB12","article-title":"Finding the largest rectangle in several classes of polygons","author":"Daniels","year":"1995"},{"key":"10.1016\/0925-7721(95)00041-0_BIB13","series-title":"Proc. 25th Allerton Conference on Communications, Control and Computing","first-page":"869","article-title":"Finding largest inscribed equilateral triangles and squares","author":"DePano","year":"1987"},{"key":"10.1016\/0925-7721(95)00041-0_BIB14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","article-title":"Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms","volume":"9","author":"Edelsbrunner","year":"1990","journal-title":"ACM Trans. on Graphics"},{"key":"10.1016\/0925-7721(95)00041-0_BIB15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00041-0_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322123.322124","article-title":"An O(n log n) algorithm for rectilinear minimal spanning trees","volume":"26","author":"Hwang","year":"1979","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0925-7721(95)00041-0_BIB17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/0403009","article-title":"An almost linear time algorithm for generalized matrix searching","volume":"3","author":"Klawe","year":"1990","journal-title":"SIAM J. Discr. Math."},{"key":"10.1016\/0925-7721(95)00041-0_BIB18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","article-title":"Medial axis transformation of a planar shape","volume":"4","author":"Lee","year":"1982","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"1","key":"10.1016\/0925-7721(95)00041-0_BIB19","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1137\/0209017","article-title":"Voronoi diagrams in L1 (L\u221e) metrics with 2-dimensional storage applications","volume":"9","author":"Lee","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00041-0_BIB20","series-title":"Proc. 23rd Allerton Conference on Communication, Control and Computing","first-page":"486","article-title":"Finding the largest rectangle in an orthogonal polygon","author":"McKenna","year":"1985"},{"key":"10.1016\/0925-7721(95)00041-0_BIB21","series-title":"Proc. 6th ACM Symp. Comput. Geom.","first-page":"350","article-title":"On solving geometric optimization problems using shortest paths","author":"Melissaratos","year":"1990"},{"key":"10.1016\/0925-7721(95)00041-0_BIB22","series-title":"Proc. 3rd Canad. Conf. Comput. Geom.","article-title":"Automatic marker making","author":"Milenkovic","year":"1991"},{"key":"10.1016\/0925-7721(95)00041-0_BIB23","series-title":"Proc. 4th Canad. Conf. Comput. Geom.","first-page":"236","article-title":"Placement and compaction of nonconvex polygons for clothing manufacture","author":"Milenkovic","year":"1992"},{"key":"10.1016\/0925-7721(95)00041-0_BIB24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(84)90124-0","article-title":"On the maximum empty rectangle problem","volume":"8","author":"Naamad","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0925-7721(95)00041-0_BIB25","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"key":"10.1016\/0925-7721(95)00041-0_BIB26","series-title":"Computational Geometry in C","author":"O'Rourke","year":"1994"},{"key":"10.1016\/0925-7721(95)00041-0_BIB27","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0196-6774(88)90028-4","article-title":"On rectangular visibility","volume":"9","author":"Overmars","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00041-0_BIB28","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(95)00041-0_BIB29","series-title":"Proc. 3rd Canad. Conf. Comput. Geom.","first-page":"96","article-title":"A generalization of staircase visibility","author":"Schuierer","year":"1991"},{"key":"10.1016\/0925-7721(95)00041-0_BIB30","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02187918","article-title":"The orthogonal convex skull problem","volume":"3","author":"Wood","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00041-0_BIB31","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(90)90016-E","article-title":"A geometric consistency theorem for a symbolic perturbation scheme","volume":"40","author":"Yap","year":"1990","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000410?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000410?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:24:59Z","timestamp":1555212299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":31,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["0925772195000410"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00041-0","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}