{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T20:25:34Z","timestamp":1762979134679},"reference-count":16,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"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":4611,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0925-7721(00)00022-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:30:40Z","timestamp":1027603840000},"page":"135-152","source":"Crossref","is-referenced-by-count":79,"title":["Approximate range searching\u2606\u2606A preliminary version of this paper appeared in the Proc. of the 11th Annual ACM Symp. on Computational Geometry, 1995, pp.\u00a0172\u2013181."],"prefix":"10.1016","volume":"17","author":[{"given":"Sunil","family":"Arya","sequence":"first","affiliation":[]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(00)00022-5_BIB001","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","article-title":"An optimal algorithm for approximate nearest neighbor searching","volume":"45","author":"Arya","year":"1998","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0925-7721(00)00022-5_BIB002","series-title":"Proc. 6th Ann. ACM Sympos. Comput. Geom.","first-page":"187","article-title":"K-d trees for semidynamic point sets","author":"Bentley","year":"1990"},{"key":"10.1016\/S0925-7721(00)00022-5_BIB003","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0190(93)90222-U","article-title":"Approximate closest-point queries in high dimensions","volume":"45","author":"Bern","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(00)00022-5_BIB004","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02573971","article-title":"How hard is halfspace range searching","volume":"10","author":"Br\u00f6nnimann","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(00)00022-5_BIB005","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/200836.200853","article-title":"A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields","volume":"42","author":"Callahan","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0925-7721(00)00022-5_BIB006","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","article-title":"Lower bounds on the complexity of polytope range searching","volume":"2","author":"Chazelle","year":"1989","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/S0925-7721(00)00022-5_BIB007","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02187743","article-title":"Quasi-optimal range searching in spaces of finite VC-dimension","volume":"4","author":"Chazelle","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(00)00022-5_BIB008","series-title":"Proc. 24th Ann. IEEE Sympos. on the Found. Comput. Sci.","first-page":"226","article-title":"Fast algorithms for the all nearest neighbors problem","author":"Clarkson","year":"1983"},{"key":"10.1016\/S0925-7721(00)00022-5_BIB009","series-title":"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms","article-title":"Balanced aspect ratio trees: Combining the advantages of k\u2013d trees and octrees","author":"Duncan","year":"1999"},{"key":"10.1016\/S0925-7721(00)00022-5_BIB010","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TIT.1985.1057040","article-title":"Rate-distortion performance of DPCM schemes for autoregressive sources","volume":"31","author":"Farvardin","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0925-7721(00)00022-5_BIB011","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02573972","article-title":"Range searching with efficient hierarchical cuttings","volume":"10","author":"Matous\u0306ek","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(00)00022-5_BIB012","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(92)90211-D","article-title":"Point location in fat subdivisions","volume":"44","author":"Overmars","year":"1992","journal-title":"Inform. Process. Lett."},{"year":"1985","series-title":"Computational Geometry: An Introduction","author":"Preparata","key":"10.1016\/S0925-7721(00)00022-5_BIB013"},{"year":"1990","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","key":"10.1016\/S0925-7721(00)00022-5_BIB014"},{"key":"10.1016\/S0925-7721(00)00022-5_BIB015","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","article-title":"An O(nlogn) algorithm for the all-nearest-neighbors problem","volume":"4","author":"Vaidya","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(00)00022-5_BIB016","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."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772100000225?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772100000225?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T17:29:51Z","timestamp":1556126991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772100000225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":16,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0925772100000225"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(00)00022-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}