{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:39Z","timestamp":1760440719822},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10365,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1016\/s0747-7171(85)80028-6","type":"journal-article","created":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T14:00:48Z","timestamp":1207749648000},"page":"47-56","source":"Crossref","is-referenced-by-count":7,"title":["Optimal solutions for a class of point retrieval problems"],"prefix":"10.1016","volume":"1","author":[{"given":"B.","family":"Chazelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Edelsbrunner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(85)80028-6_bib1","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\/S0747-7171(85)80028-6_bib2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(83)90123-0","article-title":"An improved algorithm for the fixed-radius neighbor problem","volume":"16","author":"Chazelle","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0747-7171(85)80028-6_bib3","first-page":"122","article-title":"Filtering search: A new approach to query-answering","author":"Chazelle","year":"1983","journal-title":"Proc. 24th Ann. Syrup. Found. Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80028-6_bib4","series-title":"New Upper Bounds for Neighbor Searchhlg","author":"Chazelle","year":"1984"},{"key":"10.1016\/S0747-7171(85)80028-6_bib5","first-page":"217","article-title":"The power of geometric duality","author":"Chazelle","year":"1983","journal-title":"Proc. 24th Ann. Syrmp. Found. Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80028-6_bib6","first-page":"112","article-title":"Geometric retrieval problems","author":"Cole","year":"1983","journal-title":"Proc. 24th Ann. Syrup. Found. Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80028-6_bib7","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/0020-0190(82)90090-4","article-title":"Polygonal intersection search","volume":"14","author":"Edelsbrunner","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0747-7171(85)80028-6_bib8","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","article-title":"On the shape of a set of points in the plane","volume":"IT-29","author":"Edelsbrunner","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0747-7171(85)80028-6_bib9","series-title":"Halfplanar Range Search in Linear Space and O(n0.695) Query Time","author":"Edelsbrunner","year":"1983"},{"key":"10.1016\/S0747-7171(85)80028-6_bib10","series-title":"Sorting and Searching\u2014The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0747-7171(85)80028-6_bib11","doi-asserted-by":"crossref","DOI":"10.1137\/0214019","article-title":"New data structures for orthogonal queries","author":"Willard","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T12:29:56Z","timestamp":1546172996000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717185800286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["S0747717185800286"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(85)80028-6","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}