{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T08:18:32Z","timestamp":1789978712519,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422327","type":"print"},{"value":"9783540455455","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45545-0_96","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T14:01:49Z","timestamp":1195221709000},"page":"842-851","source":"Crossref","is-referenced-by-count":17,"title":["On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions"],"prefix":"10.1007","author":[{"given":"Songrit","family":"Maneewongvatana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"issue":"2","key":"96_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02716805","volume":"16","author":"S. Arya","year":"1996","unstructured":"S. Arya, D. M. Mount, and O. Narayan. Accounting for boundary effects in nearest neighbor searching. Discrete Comput. Geom., 16(2):155\u2013176, 1996.","journal-title":"Discrete Comput. Geom."},{"key":"96_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891\u2013923, 1998.","journal-title":"Journal of the ACM"},{"issue":"9","key":"96_CR3","doi-asserted-by":"publisher","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, 1975.","journal-title":"Communications of the ACM"},{"key":"96_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/3-540-57155-8_247","volume-title":"Proc. 3rd Workshop Algorithms Data Struct.","author":"M. Bern","year":"1993","unstructured":"M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 188\u2013199. Springer-Verlag, 1993."},{"issue":"4","key":"96_CR5","doi-asserted-by":"publisher","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 Trans. Math. Software, 6(4):563\u2013580, 1980.","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"96_CR6","doi-asserted-by":"publisher","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 Trans. Math. Software, 5(2):183\u2013192, 1979.","journal-title":"ACM Trans. Math. Software"},{"key":"96_CR7","series-title":"Technical Report","volume-title":"A review of dimension reduction techniques","author":"M. Carreira-Perpi\u00f1-an","year":"1996","unstructured":"M. Carreira-Perpi\u00f1-an. A review of dimension reduction techniques. Technical Report CS-96-09, Dept. of Computer Science, University of Sheffield, UK, 1996."},{"key":"96_CR8","unstructured":"C. Duncan, M. Goodrich, and S. Kobourov. Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 300\u2013309, 1999."},{"issue":"3","key":"96_CR9","doi-asserted-by":"publisher","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 Trans. Math. Software, 3(3):209\u2013226, 1977.","journal-title":"ACM Trans. Math. Software"},{"key":"96_CR10","doi-asserted-by":"crossref","unstructured":"Christos Faloutsos and Ibrahim Kamel. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In Proc. Annu. ACM Sympos. Principles Database Syst., pages 4\u201313, 1994.","DOI":"10.1145\/182591.182593"},{"key":"96_CR11","doi-asserted-by":"crossref","unstructured":"K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 2nd edition, 1990.","DOI":"10.1016\/B978-0-08-047865-4.50007-7"},{"key":"96_CR12","doi-asserted-by":"crossref","unstructured":"P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604\u2013613, 1998.","DOI":"10.1145\/276698.276876"},{"key":"96_CR13","doi-asserted-by":"crossref","unstructured":"J. M. Kleinberg. Two algorithms for nearest-neighbor search in high dimension. In Proc. 29th Annu. ACM Sympos. Theory Comput., pages 599\u2013608, 1997.","DOI":"10.1145\/258533.258653"},{"key":"96_CR14","unstructured":"D. M. Mount and S. Arya. ANN: A library for approximate nearest neighbor searching. Center for Geometric Computing 2nd Annual Workshop on Computational Geometry, 1997."},{"key":"96_CR15","unstructured":"S. Maneewongvatana and D. Mount. Analysis of approximate nearest neighbor searching with clustered point sets. In ALENEX, 1999."},{"key":"96_CR16","unstructured":"S. Maneewongvatana and D. Mount. It\u2019s okay to be skinny, if your friends are fat. Center for Geometric Computing 4th Annual Workshop on Computational Geometry, 1999."},{"key":"96_CR17","doi-asserted-by":"crossref","unstructured":"S. Maneewongvatana and D. Mount. On the efficiency of nearest neighbor searching with data clustered in lower dimensions. Technical Report CS-TR-4209, Dept. Computer Science, Univ. Maryland, 2001.","DOI":"10.1007\/3-540-45545-0_96"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2014 ICCS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45545-0_96","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:37:14Z","timestamp":1556969834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45545-0_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422327","9783540455455"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45545-0_96","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}