{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T05:10:22Z","timestamp":1713417022290},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10060,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/s0019-9958(86)80030-4","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"105-124","source":"Crossref","is-referenced-by-count":30,"title":["New upper bounds for neighbor searching"],"prefix":"10.1016","volume":"68","author":[{"given":"B.","family":"Chazelle","sequence":"first","affiliation":[]},{"given":"R.","family":"Cole","sequence":"additional","affiliation":[]},{"given":"F.P.","family":"Preparata","sequence":"additional","affiliation":[]},{"given":"C.","family":"Yap","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(86)80030-4_bib1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Comm. ACM"},{"issue":"No. 3","key":"10.1016\/S0019-9958(86)80030-4_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."},{"issue":"No. 4","key":"10.1016\/S0019-9958(86)80030-4_bib3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(86)80030-4_bib4","series-title":"Proc. 24th Annu. Sympos. Found. of Comput. Sci.","first-page":"122","article-title":"Filtering search: A new approach to query-answering","author":"Chazelle","year":"1983"},{"issue":"No. 1","key":"10.1016\/S0019-9958(86)80030-4_bib5","doi-asserted-by":"crossref","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"No. 6","key":"10.1016\/S0019-9958(86)80030-4_bib6","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbor Voronoi diagrams in the plane","volume":"C-31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"No. 3","key":"10.1016\/S0019-9958(86)80030-4_bib7","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(86)80030-4_bib8","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0019-9958(86)80030-4_bib9","article-title":"Predicate-oriented database search algorithms. Harvard Univ., Aiken Comput. Lab., Ph.D. thesis","author":"Willard","year":"1978","journal-title":"Report TR-20-78"},{"key":"10.1016\/S0019-9958(86)80030-4_bib10","series-title":"Proc. 15th Ann. SIGACT Sympos.","first-page":"258","article-title":"A 3-space partition and its applications","author":"Yao","year":"1983"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:37Z","timestamp":1548525277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995886800304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["S0019995886800304"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80030-4","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}