Nearest neighbor queries in metric spaces

Discrete and Computational Geometry

Volumn 22, Issue 1, 1999, Pages 63-93

  Clarkson, K L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033453107     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009449     Document Type: Article

References (11)

1. S. Brin. Near neighbor search in large metric spaces. In Proc. 21st Internat. Conf. on Very Large Data Bases, pages 574-584, 1995.
2. K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science, pages 226-232, 1983.
3. K. L. Clarkson. A randomized algorithm for closest-point queries. SIAM J. Comput., 17:830-847, 1988.
4. K. L. Clarkson. Randomized geometric algorithms. In D.-Z. Du and F. K. Hwang, editors. Computing in Euclidean Geometry, pages 117-162. Lecture Notes Series on Computing, volume 1.World Scientific, Singapore, 1992.
5. C. Faloutsos and V. Caede. Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension. In Proc. 22nd Internal. Conf. on Very Large Data Bases, 1996.
6. C. D. Feustel and L. G. Shapiro. The nearest neighbor problem in an abstract metric space. Pattern Recognition Lett., 1:125-128, December 1982.
7. R. Motwani and P. Raghavan. Deferred data structuring: query-driven preprocessing for geometric search problems. In Proc. 2nd Ann. ACM Symp. on Computational Geometry, pages 303-312, 1986.
8. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1993.
9. J. K. Uhlmann. Satisfying general proximity/similarity queries with metric trees. Inform. Process. Lett., 40:175-179, 1991.
10. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4:101-115, 1989.
11. P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 311-321, 1993.