Optimal Expected-Time Algorithms for Closest Point Problems
- 1 December 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 6 (4), 563-580
- https://doi.org/10.1145/355921.355927
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- A note on Rabin's nearest-neighbor algorithmInformation Processing Letters, 1979
- Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate SpacesIEEE Transactions on Computers, 1978
- Sorting by distributive partitioningInformation Processing Letters, 1978
- An Algorithm for Finding Best Matches in Logarithmic Expected TimeACM Transactions on Mathematical Software, 1977
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Sequence-to-sequence recursivenessInformation Processing Letters, 1975