{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:28Z","timestamp":1760439988043},"reference-count":5,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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 Processing Letters"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0020-0190(94)00079-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"189-193","source":"Crossref","is-referenced-by-count":12,"title":["Computing a maximum axis-aligned rectangle in a convex polygon"],"prefix":"10.1016","volume":"51","author":[{"given":"Paul","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus-Uwe","family":"H\u00f6ffgen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00079-4_BIB1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/BFb0032068","article-title":"Approximation of convex polygons","author":"Alt","year":"1990","journal-title":"Proc. 17th Internat. Colloq. on Automata, Languages and Programming"},{"key":"10.1016\/0020-0190(94)00079-4_BIB2","article-title":"Finding the maximum area axis-parallel rectangle in a polygon","author":"Daniels","year":"1993","journal-title":"Proc. 5th Canadian Conf. on Computational Geometry"},{"key":"10.1016\/0020-0190(94)00079-4_BIB3","series-title":"Proc. 9th Internat. Conf. on Fundamentals of Computation Theory","first-page":"244","article-title":"Approximations with axis-aligned rectangles","volume":"710","author":"Fischer","year":"1993"},{"key":"10.1016\/0020-0190(94)00079-4_BIB4","first-page":"133","article-title":"Tentative prune-and-search for computing Voronoi vertices","author":"Kirkpatrick","year":"1993","journal-title":"Proc. ACM Conf. on Computational Geometry"},{"key":"10.1016\/0020-0190(94)00079-4_BIB5","article-title":"Finding the largest empty rectangle in an orthogonal polygon","author":"McKenna","year":"1985","journal-title":"Proc. 23rd Ann. Allerton Conference on Communication, Control and Computation"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:32Z","timestamp":1555131092000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0020019094000794"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00079-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}