Approximate nearest neighbor queries revisited

Discrete and Computational Geometry

Volumn 20, Issue 3, 1998, Pages 359-373

  Chan, T M ^a  

^a UNIVERSITY OF MIAMI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032341649     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009390     Document Type: Article

References (23)

1. P. K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom., 6:407-422, 1991.
2. P. K. Agarwal and J. Matoušek. Ray shooting and parametric search. SIAM J. Comput., 22:764-806, 1993.
3. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. 27th ACM Symp. Theory of Computing, pages 489-498, 1995.
4. S. Arya and D. M. Mount. Approximate nearest neighbor queries in fixed dimensions. In Proc. 4th ACM-SIAM Symp. Discrete Algorithms, pages 271-280, 1993.
5. S. Arya and D. M. Mount. Approximate range searching. In Proc. 11th ACM Symp. Computational Geometry, pages 172-181, 1995.
6. S. Arya, D. M. Mount, and O. Narayan. Accounting for boundary effects in nearest neighbor searching. Discrete Comput. Geom., 16:155-176, 1996.
7. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Symp. Discrete Algorithms, pages 573-582, 1994.
8. M. Bern. Approximate closest-point queries in high dimensions. Inform. Process. Lett., 45:95-99, 1993.
9. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proc. 4th ACM-SIAM Symp. Discrete Algorithms, pages 291-300, 1993.
10. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Comput., 21:671-696, 1992.
11. K. L. Clarkson. An algorithm for approximate closest-point queries. In Proc. 10th ACM Symp. Computational Geometry, pages 160-164, 1994.
12. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. Assoc Comput. Mach., 34:200-208, 1987.
13. P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. To appear in Proc. 30th ACM Symp. Theory of Computing, 1998.
14. m. SIAM J. Comput., 7:147-153, 1978.
15. S. Kapoor and M. Smid. New techniques for exact and approximate dynamic closest-point problems. SIAM J. Comput., 25:775-796, 1996.
16. J. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In Proc. 29th ACM Symp. Theory of Computing, pages 599-608, 1997.
17. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. To appear in Proc. 30th ACM Symp. Theory of Computing, 1998.
18. H. P. Lenhof and M. Smid. Sequential and parallel algorithms for the k closest pairs problem. Internal. J. Comput. Geom. Appl., 5:273-288, 1995.
19. J. Matoušek and O. Schwarzkopt. On ray shooting in convex polytopes. Discrete Comput. Geom 10-215-232, 1993.
20. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction Springer-Verlag, New York, 1985.
21. J. S. Salowe. Construction of multidimensional spanner graphs, with applications to minimum spanning trees. In Proc. 7th ACM Symp. Computational Geometry, pages 256-261, 1991.
22. P M. Vaidya. A sparse graph almost as good as the complete graph on points in k dimensions. Discrete Comput. Geom., 6:369-381, 1991.
23. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11:721-736, 1982.