{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T22:19:18Z","timestamp":1696630758907},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":[[1995,1]]},"DOI":"10.1016\/0020-0255(94)00053-e","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:22:57Z","timestamp":1027635777000},"page":"25-44","source":"Crossref","is-referenced-by-count":3,"title":["On the area of intersection between two closed 2-D objects"],"prefix":"10.1016","volume":"82","author":[{"given":"R.","family":"Venkatasubramanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(94)00053-E_BIB1","series-title":"Proceedings of the Third Canadian Conference on Computational Geometry","first-page":"243","article-title":"Automatic marker making","author":"Milenkovic","year":"1991"},{"key":"10.1016\/0020-0255(94)00053-E_BIB2","series-title":"Proceedings of the Fourth Canadian Conference on Computational Geometry","first-page":"236","article-title":"Placement and compaction of nonconvex polygons for clothing manufacture","author":"Milenkovic","year":"1992"},{"key":"10.1016\/0020-0255(94)00053-E_BIB3","series-title":"Proceedings of the Fifth Canadian Conference on Computational Geometry","first-page":"322","article-title":"Finding maximum area axis-parallel rectangle in a polygon","author":"Daniels","year":"1993"},{"key":"10.1016\/0020-0255(94)00053-E_BIB4","series-title":"Computational geometry lecture notes for MIT","author":"Aggarwal","year":"1988"},{"key":"10.1016\/0020-0255(94)00053-E_BIB5","series-title":"Proceedings of the 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\/0020-0255(94)00053-E_BIB6","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 Computational Geometry"},{"key":"10.1016\/0020-0255(94)00053-E_BIB7","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0020-0255(94)00053-E_BIB8","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:002002559400053E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559400053E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T13:50:12Z","timestamp":1555249812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559400053E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["002002559400053E"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(94)00053-e","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}