Summary: An Optimal Algorithm for Approximate Nearest
Neighbor Searching in Fixed Dimensions
Hong Kong University of Science and Technology, Hong Kong,
David M. Mount
University of Maryland, College Park, Maryland,
Nathan S. Netanyahu
Dept. of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan 52900,
University of Maryland, College Park, Maryland
and University of the District of Columbia, Washington, DC
Angela Y. Wu
The American University, Washington, DC
A preliminary version of this paper appeared in the Proceedings of the Fifth Annual ACM-SIAM
Symposium on Discrete Algorithms, 1994, pp. 573582.
S. Arya was supported by HK RGC grant HKUST 736/96E. Part of this research was conducted
while the author was visiting the Max-Planck-Institut f¨ur Informatik, Saarbr¨ucken, Germany.
D. Mount was supported by the National Science Foundation under grant CCR9712379. N. Ne-