{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:37:35Z","timestamp":1703187455825},"reference-count":21,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1016\/0196-6774(85)90030-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"515-542","source":"Crossref","is-referenced-by-count":35,"title":["Batched dynamic solutions to decomposable searching problems"],"prefix":"10.1016","volume":"6","author":[{"given":"Herbert","family":"Edelsbrunner","sequence":"first","affiliation":[]},{"given":"Mark H","family":"Overmars","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90030-6_BIB1","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(85)90030-6_BIB2","first-page":"133","article-title":"A note on Euclidean near neighbor searching in the plane","volume":"8","author":"Bentley","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90030-6_BIB3","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(85)90030-6_BIB4","article-title":"Dynamic Data Structures for Orthogonal Intersection Queries","author":"Edelsbrunner","year":"1980"},{"key":"10.1016\/0196-6774(85)90030-6_BIB5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0020-0190(82)90090-4","article-title":"Polygonal intersection searching","volume":"14","author":"Edelsbrunner","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90030-6_BIB6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0020-0190(81)90053-3","article-title":"On the intersection of orthogonal objects","volume":"13","author":"Edelsbrunner","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90030-6_BIB7","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0020-0190(82)90068-0","article-title":"On the equivalence of some rectangle problems","volume":"14","author":"Edelsbrunner","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90030-6_BIB8","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90030-6_BIB9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0196-6774(82)90021-9","article-title":"An improved algorithm for the rectangle enclosure problem","volume":"3","author":"Lee","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90030-6_BIB10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0196-6774(81)90033-X","article-title":"Finding intersections of rectangles by range search","volume":"2","author":"Lee","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90030-6_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(85)90030-6_BIB12","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0196-6774(81)90030-4","volume":"2","author":"McCreight","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90030-6_BIB13","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane-sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(85)90030-6_BIB14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(81)90025-0","article-title":"Dynamization of order decomposable set problems","volume":"2","author":"Overmars","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90030-6_BIB15","article-title":"The design of dynamic data structures","volume":"Vol. 156","author":"Overmars","year":"1983"},{"key":"10.1016\/0196-6774(85)90030-6_BIB16","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","article-title":"Worst-case optimal insertion and deletion methods for decomposable searching problems","volume":"12","author":"Overmars","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90030-6_BIB17","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0210035","article-title":"A new approach to planar point location","volume":"10","author":"Preparata","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90030-6_BIB18","series-title":"Proc. 17th Annual IEEE Sympos. on Foundations of Computer Science","first-page":"208","article-title":"Geometric intersection problems","author":"Shamos","year":"1976"},{"key":"10.1016\/0196-6774(85)90030-6_BIB19","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0196-6774(81)90027-4","article-title":"The measure problem for rectangular ranges in d-space","volume":"2","author":"van Leeuwen","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90030-6_BIB20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/0211012","article-title":"Polygon retrieval","volume":"11","author":"Willard","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(85)90030-6_BIB21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","article-title":"New Data Structures for Orthogonal Queries","volume":"14","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900306?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900306?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:25:55Z","timestamp":1548725155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["0196677485900306"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90030-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}