Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266.
Authors:
- David M. MountDMDavid M. Mount
- Nathan S. NetanyahuNNNathan S. Netanyahu
- Ruth SilvermanRSRuth Silverman
- Angela Y. WuAWAngela Y. Wu
- 1 December 2000
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 17 (3-4) , 97-119
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An optimal algorithm for approximate nearest neighbor searching fixed dimensionsJournal of the ACM, 1998
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fieldsJournal of the ACM, 1995
- An improved method for finding nearest neighborsPattern Recognition Letters, 1993
- Approximate closest-point queries in high dimensionsInformation Processing Letters, 1993
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- An efficient branch-and-bound nearest neighbour classifierPattern Recognition Letters, 1988
- An improved branch and bound algorithm for computing k-nearest neighborsPattern Recognition Letters, 1985
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean SpaceACM Transactions on Mathematical Software, 1979
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975