AnO(n logn) algorithm for the all-nearest-neighbors Problem
Author:
- 1 March 1989
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (2) , 101-115
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Computational Geometry1985
- Scaling and related techniques for geometry problems1984
- Fast algorithms for the all nearest neighbors problem1983
- Lower bounds for algebraic computation trees1983
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- The complexity of finding fixed-radius near neighborsInformation Processing Letters, 1977
- Finding near neighbours in K-dimensional spaceInformation Processing Letters, 1975