{"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":1762429983995},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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,6]]},"DOI":"10.1016\/0196-6774(82)90016-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"160-176","source":"Crossref","is-referenced-by-count":45,"title":["Rectilinear line segment intersection, layered segment trees, and dynamization"],"prefix":"10.1016","volume":"3","author":[{"given":"V.K","family":"Vaishnavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90016-5_BIB1","series-title":"Solutions to Klee's rectangle problems","author":"Bentley","year":"1977"},{"key":"10.1016\/0196-6774(82)90016-5_BIB2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90016-5_BIB3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/356789.356797","article-title":"Data structures for range searching","volume":"11","author":"Bentley","year":"1979","journal-title":"Comput. Surveys"},{"key":"10.1016\/0196-6774(82)90016-5_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00263991","article-title":"Efficient worst-case data structures for range searching","volume":"13","author":"Bentley","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0196-6774(82)90016-5_BIB5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","author":"Bentley","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(82)90016-5_BIB6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searching problems. I. Static-to-dynamic transformation","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algor."},{"key":"10.1016\/0196-6774(82)90016-5_BIB7","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","article-title":"An optimal worst-case algorithm for reporting intersections of rectangles","author":"Bentley","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(82)90016-5_BIB8","article-title":"Optimizing the Dynamization of Decomposable Searching Problems","author":"Edelsbrunner","year":"1979","journal-title":"TU Graz, IIG Report 35"},{"key":"10.1016\/0196-6774(82)90016-5_BIB9","series-title":"Dynamic rectangle intersection searching","author":"Edelsbrunner","year":"1980"},{"key":"10.1016\/0196-6774(82)90016-5_BIB10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0020-0190(80)90073-3","article-title":"Dynamization of decomposable searching problems","volume":"10","author":"van Leeuwen","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90016-5_BIB11","series-title":"Discrete Structures and Algorithms","first-page":"17","article-title":"Dynamic solutions of decomposable searching problems","author":"Maurer","year":"1979"},{"key":"10.1016\/0196-6774(82)90016-5_BIB12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02241781","article-title":"Two general methods for dynamizing decomposable searching problems","volume":"26","author":"Overmars","year":"1981","journal-title":"Computing"},{"key":"10.1016\/0196-6774(82)90016-5_BIB13","article-title":"Transforming Static Data Structures to Dynamic Structures","author":"Saxe","year":"1979","journal-title":"Carnegie-Mellon Report CMU-CS-79"},{"key":"10.1016\/0196-6774(82)90016-5_BIB14","article-title":"Computational Geometry","author":"Shamos","year":"1977"},{"key":"10.1016\/0196-6774(82)90016-5_BIB15","series-title":"Proc. 17th Annual IEEE Symposium on Foundations of Computer Science","first-page":"208","article-title":"Geometric intersection problems","author":"Shamos","year":"1976"},{"key":"10.1016\/0196-6774(82)90016-5_BIB16","first-page":"426","article-title":"The rectangle intersection problem revisited","author":"Six","year":"1980"},{"key":"10.1016\/0196-6774(82)90016-5_BIB17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/TC.1982.1675973","article-title":"Counting and reporting intersections of d-ranges","author":"Six","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(82)90016-5_BIB18","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/TC.1982.1675881","article-title":"Computing point enclosures","author":"Vaishnavi","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(82)90016-5_BIB19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0255(80)90010-9","article-title":"Space and time optimal algorithms for a class of rectangle intersection problems","volume":"21","author":"Vaishnavi","year":"1980","journal-title":"Inform. Sci."},{"key":"10.1016\/0196-6774(82)90016-5_BIB20","series-title":"New Data Structures for Orthogonal Queries","author":"Willard","year":"1978"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900165?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900165?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:51:58Z","timestamp":1548726718000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0196677482900165"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90016-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}