AnO(n logn) algorithm for the all-nearest-neighbors Problem

This publication has 8 references indexed in Scilit:

• Computational Geometry
  Published by Springer Nature ,1985
• Scaling and related techniques for geometry problems
  Published by Association for Computing Machinery (ACM) ,1984
• Fast algorithms for the all nearest neighbors problem
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Lower bounds for algebraic computation trees
  Published by Association for Computing Machinery (ACM) ,1983
• Optimal Expected-Time Algorithms for Closest Point Problems
  ACM Transactions on Mathematical Software, 1980
• Multidimensional divide-and-conquer
  Communications of the ACM, 1980
• The complexity of finding fixed-radius near neighbors
  Information Processing Letters, 1977
• Finding near neighbours in K-dimensional space
  Information Processing Letters, 1975