{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:37Z","timestamp":1759638157769},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0020-0190(93)90222-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"95-99","source":"Crossref","is-referenced-by-count":47,"title":["Approximate closest-point queries in high dimensions"],"prefix":"10.1016","volume":"45","author":[{"given":"Marshall","family":"Bern","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90222-U_BIB1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected-time algorithms for closest point problems","volume":"6","author":"Bentley","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0020-0190(93)90222-U_BIB2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","article-title":"Multidimensional search problems","volume":"5","author":"Dobkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90222-U_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees - a data structure for retrieval on composite keys","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(93)90222-U_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0020-0190(93)90222-U_BIB5","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"Computing Surveys"},{"year":"1990","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","key":"10.1016\/0020-0190(93)90222-U_BIB6"},{"key":"10.1016\/0020-0190(93)90222-U_BIB7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02187718","article-title":"An O(n log n) algorithm for the all-nearest-neighbors problem","volume":"4","author":"Vaidya","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(93)90222-U_BIB8","first-page":"163","article-title":"A general approach to d-dimensional geometric queries","author":"Yao","year":"1985","journal-title":"Proc. 17th Ann. ACM Symp. Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390222U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390222U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:08Z","timestamp":1555143968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390222U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["002001909390222U"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90222-u","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}