{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:53:03Z","timestamp":1762429983810},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0196-6774(82)90021-9","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"218-224","source":"Crossref","is-referenced-by-count":29,"title":["An improved algorithm for the rectangle enclosure problem"],"prefix":"10.1016","volume":"3","author":[{"given":"D.T","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.P","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90021-9_BIB1","first-page":"179","article-title":"Fast algorithms for LSI artwork analysis","volume":"2","author":"Baird","year":"1978","journal-title":"J. Design Automation Fault-Tolerant Comput."},{"issue":"n. 3","key":"10.1016\/0196-6774(82)90021-9_BIB2","first-page":"241","article-title":"4-dimensional binary search trees as a means to speed up associative searches in the design verification of integrated circuits","volume":"2","author":"Lauther","year":"1978","journal-title":"J. Design Automation Fault-Tolerant Comput."},{"key":"10.1016\/0196-6774(82)90021-9_BIB3","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0146-664X(80)90034-9","article-title":"Data structures for the rectangle containment and enclosure problems","volume":"13","author":"Vaishnavi","year":"1980","journal-title":"Computer Graphics and Image Processing"},{"issue":"n. 9","key":"10.1016\/0196-6774(82)90021-9_BIB4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0196-6774(82)90021-9_BIB5","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BF01933636","article-title":"The rectangle intersection problem revisited","volume":"20","author":"Six","year":"1981","journal-title":"BIT"},{"issue":"no. 4","key":"10.1016\/0196-6774(82)90021-9_BIB6","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","article-title":"On finding the maxima of a set of vectors","volume":"22","author":"Kung","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(82)90021-9_BIB7","author":"Knuth","year":"1972"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:51:51Z","timestamp":1548744711000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0196677482900219"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90021-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}