An optimal algorithm for approximate nearest neighbor searching fixed dimensions

@article{Arya1998AnOA,
  title={An optimal algorithm for approximate nearest neighbor searching fixed dimensions},
  author={S. Arya and D. Mount and N. Netanyahu and R. Silverman and A. Wu},
  journal={J. ACM},
  year={1998},
  volume={45},
  pages={891-923}
}
Consider a set of <italic>S</italic> of <italic>n</italic> data points in real <italic>d</italic>-dimensional space, R<supscrpt>d</supscrpt>, where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess <italic>S</italic> into a data structure, so that given any query point <italic>q</italic><inline-equation> <f>∈</f></inline-equation> R<supscrpt>d</supscrpt>, is the closest point of S to <italic>q</italic> can be reported quickly. Given any positive… Expand
Distance browsing in spatial databases
Approximate Nearest Neighbor under edit distance via product metrics
  • P. Indyk
  • Mathematics, Computer Science
  • SODA '04
  • 2004
Efficient algorithms for substring near neighbor problem
Linear-size approximate voronoi diagrams
Entropy based nearest neighbor search in high dimensions
...
1
2
3
4
5
...

References

SHOWING 1-7 OF 7 REFERENCES
Approximate nearest neighbor queries revisited
An Optimal Algorithm for Closest-Pair Maintenance
Optimal Expected-Time Algorithms for Closest Point Problems
An Algorithm for Finding Best Matches in Logarithmic Expected Time
A data structure for dynamically maintaining rooted trees
A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potentional fields
  • Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Vancouver, B.C., Canada, May 4 – 6). ACM, New York, pp. 546 –556.
  • 1992