Approximate Nearest Neighbor Queries Revisited
Author:
Open Access
- 1 October 1998
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 20 (3) , 359-373
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- New Techniques for Exact and Approximate Dynamic Closest-Point ProblemsSIAM Journal on Computing, 1996
- Accounting for boundary effects in nearest-neighbor searchingDiscrete & Computational Geometry, 1996
- SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEMInternational Journal of Computational Geometry & Applications, 1995
- On ray shooting in convex polytopesDiscrete & Computational Geometry, 1993
- Approximate closest-point queries in high dimensionsInformation Processing Letters, 1993
- An Optimal Algorithm for Intersecting Three-Dimensional Convex PolyhedraSIAM Journal on Computing, 1992
- Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry, 1991
- A sparse graph almost as good as the complete graph on points inK dimensionsDiscrete & Computational Geometry, 1991
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982