{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T12:52:29Z","timestamp":1768567949118,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":["Computer-Aided Design"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0010-4485(00)00141-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"167-172","source":"Crossref","is-referenced-by-count":41,"title":["Algorithm for finding all k nearest neighbors"],"prefix":"10.1016","volume":"34","author":[{"given":"Les A.","family":"Piegl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wayne","family":"Tiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0010-4485(00)00141-X_BIB1","series-title":"Interpolation and approximation","author":"Davis","year":"1975"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1142\/S0218195992000147","article-title":"Simple algorithms for enumerating interpoint distances and finding k nearest neighbors","volume":"2","author":"Dickerson","year":"1992","journal-title":"Internat J Comput Geom Appl"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB3","series-title":"Algorithms in combinatorial geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB4","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0167-8396(00)00009-1","article-title":"On finding p-th nearest neighbors of scattered points in two dimensions for small p","volume":"17","author":"Goodsell","year":"2000","journal-title":"Computer Aided Geometric Design"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB5","series-title":"The art of computer programming, vol. III: sorting and searching","author":"Knuth","year":"1973"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB6","series-title":"Computational geometry and computer graphics in C++","author":"Laszlo","year":"1996"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB7","series-title":"Computational geometry in C","author":"O'Rourke","year":"1994"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB8","series-title":"Computational geometry: an introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB9","series-title":"Design and analysis of spacial data structures","author":"Samet","year":"1990"},{"key":"10.1016\/S0010-4485(00)00141-X_BIB10","series-title":"Applications of spacial data structures","author":"Samet","year":"1990"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001044850000141X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001044850000141X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:53:12Z","timestamp":1556725992000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001044850000141X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S001044850000141X"],"URL":"https:\/\/doi.org\/10.1016\/s0010-4485(00)00141-x","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}