Fast algorithms for the all nearest neighbors problem
- 1 November 1983
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 226-232
- https://doi.org/10.1109/sfcs.1983.16
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Quadtree and Related Hierarchical Data StructuresACM Computing Surveys, 1984
- A hierarchical data structure for multidimensional digital imagesCommunications of the ACM, 1983
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- Approximation algorithms for convex hullsCommunications of the ACM, 1982
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Combinatorial solutions of multidimensional divide-and-conquer recurrencesJournal of Algorithms, 1980