{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:34:45Z","timestamp":1648856085205},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":[[2002,10]]},"DOI":"10.1016\/s0020-0190(02)00221-1","type":"journal-article","created":{"date-parts":[[2002,9,10]],"date-time":"2002-09-10T02:34:31Z","timestamp":1031625271000},"page":"17-22","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of various trees for nearest-point search with\/without the Voronoi diagram"],"prefix":"10.1016","volume":"84","author":[{"given":"Takeshi","family":"Kanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kokichi","family":"Sugihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0020-0190(02)00221-1_BIB001","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":"6","key":"10.1016\/S0020-0190(02)00221-1_BIB002","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(75)90034-4","article-title":"Analysis of range searches in quad trees","volume":"3","author":"Bentley","year":"1975","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00221-1_BIB003","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\/S0020-0190(02)00221-1_BIB004","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","article-title":"An algorithm for finding nearest neighbours","volume":"24","author":"Friedman","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(02)00221-1_BIB005","series-title":"Computational Science\u2014ICCS 2001, Part I, San Francisco, CA","first-page":"663","article-title":"On a nearest-neighbour problem in Minkowski and power metrics","author":"Gavrilova","year":"2001"},{"issue":"3","key":"10.1016\/S0020-0190(02)00221-1_BIB006","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","article-title":"Location of a point in a planar subdivision and its applications","volume":"6","author":"Lee","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00221-1_BIB007","series-title":"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS","author":"Samet","year":"1990"},{"key":"10.1016\/S0020-0190(02)00221-1_BIB008","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002211?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002211?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:28:47Z","timestamp":1556796527000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0020019002002211"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00221-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}