Accounting for boundary effects in nearest-neighbor searching

Discrete and Computational Geometry

Volumn 16, Issue 2, 1996, Pages 155-176

  Arya, S ^a   Mount, D M ^b   Narayan, O ^c  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF MARYLAND   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030509188     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02716805     Document Type: Article

References (15)

1. G. B. Arfken. Mathematical Methods for Physicists, 3rd edition. Academic Press, New York, 1985.
2. 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-280, 1993.
3. 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-390. IEEE Press, New York, 1993.
4. 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-582, 1994.
5. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9):509-517, September 1975.
6. 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-580, 1980.
7. K. L. Clarkson. An algorithm for approximate closest-point queries. Proceedings of the Tenth Annual ACM Symposium on Computational Geometry, pages 160-164, 1994.
8. J. G. Cleary. Analysis of an algorithm for finding nearest neighbors in Euclidean space. ACM Transactions on Mathematical Software, 5(2):183-192, June 1979.
9. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1, 3rd edition. Wiley Eastern, New York, 1968.
10. 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-226, September 1977.
11. A. Gersho and R. M. Gray. Vector Quantization and Signal Compression. Kluwer, Dordrecht, 1991.
12. G. Goertzel and N. Tralli. Some Mathematical Methods of Physics. McGraw-Hill, New York, 1960.
13. R. L. Rivest. On the optimality of Elias's algorithm for performing best-match searches. In Information Processing, pages 678-681. North-Holland, Amsterdam, 1974.
14. R. L. Sproull. Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica, 6:579-589, 1991.
15. T. Welch. Bounds on the information retrieval efficiency of static file structures. Technical Report 88, MIT, June 1971.