{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T17:27:46Z","timestamp":1679333266717},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1007\/bf02716805","type":"journal-article","created":{"date-parts":[[2007,10,2]],"date-time":"2007-10-02T06:00:15Z","timestamp":1191304815000},"page":"155-176","source":"Crossref","is-referenced-by-count":14,"title":["Accounting for boundary effects in nearest-neighbor searching"],"prefix":"10.1007","volume":"16","author":[{"given":"S.","family":"Arya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02716805_CR1","volume-title":"Mathematical Methods for Physicists","author":"G. B. Arfken","year":"1985","unstructured":"G. B. Arfken.Mathematical Methods for Physicists, 3rd edition. Academic Press, New York, 1985.","edition":"3rd edition"},{"key":"BF02716805_CR2","unstructured":"S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions.Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 271\u2013280, 1993."},{"key":"BF02716805_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/DCC.1993.253111","volume-title":"Proceedings of DCC '93: Data Compression Conference","author":"S. Arya","year":"1993","unstructured":"S. Arya and D. M. Mount. Algorithms for fast vector quantization. In J. A. Storer and M. Cohn, editors,Proceedings of DCC '93: Data Compression Conference pages 381\u2013390. IEEE Press, New York, 1993."},{"key":"BF02716805_CR4","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching.Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, pages 573\u2013582, 1994."},{"issue":"9","key":"BF02716805_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"J. L. Bentley. Multidimensional binary search trees used for associative searching.Communications of the ACM, 18(9):509\u2013517, September 1975.","journal-title":"Communications of the ACM"},{"issue":"4","key":"BF02716805_CR6","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, B. W. Weide, and A. C. Yao. Optimal expected-time algorithms for closest point problems.ACM Transactions on Mathematical Software, 6(4):563\u2013580, 1980.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02716805_CR7","doi-asserted-by":"crossref","unstructured":"K. L. Clarkson. An algorithm for approximate closest-point queries.Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, pages 160\u2013164, 1994.","DOI":"10.1145\/177424.177609"},{"issue":"2","key":"BF02716805_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/355826.355832","volume":"5","author":"J. G. Cleary","year":"1979","unstructured":"J. G. Cleary. Analysis of an algorithm for finding nearest neighbors in Euclidean space.ACM Transactions on Mathematical Software, 5(2):183\u2013192, June 1979.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02716805_CR9","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"W. Feller.An Introduction to Probability Theory and Its Applications, volume 1, 3rd edition. Wiley Eastern, New York, 1968.","edition":"3rd edition"},{"issue":"3","key":"BF02716805_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time.ACM Transactions on Mathematical Software, 3(3):209\u2013226, September 1977.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02716805_CR11","volume-title":"Vector Quantization and Signal Compression","author":"A. Gersho","year":"1991","unstructured":"A. Gersho and R. M. Gray.Vector Quantization and Signal Compression. Kluwer, Dordrecht, 1991."},{"key":"BF02716805_CR12","volume-title":"Some Mathematical Methods of Physics","author":"G. Goertzel","year":"1960","unstructured":"G. Goertzel and N. Tralli.Some Mathematical Methods of Physics. McGraw-Hill, New York, 1960."},{"key":"BF02716805_CR13","first-page":"678","volume-title":"Information Processing","author":"R. L. Rivest","year":"1974","unstructured":"R. L. Rivest. On the optimality of Elias's algorithm for performing best-match searches. InInformation Processing, pages 678\u2013681. North-Holland, Amsterdam, 1974."},{"key":"BF02716805_CR14","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R. L. Sproull","year":"1991","unstructured":"R. L. Sproull. Refinements to nearest-neighbor searching ink-dimensional trees.Algorithmica, 6:579\u2013589, 1991.","journal-title":"Algorithmica"},{"key":"BF02716805_CR15","unstructured":"T. Welch. Bounds on the information retrieval efficiency of static file structures. Technical Report 88, MIT, June 1971."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02716805.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02716805\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02716805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T09:57:24Z","timestamp":1558432644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02716805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF02716805"],"URL":"https:\/\/doi.org\/10.1007\/bf02716805","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}