Summary: An Optimal Algorithm for Approximate Nearest
Neighbor Searching in Fixed Dimensions
Sunil Arya
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,
Israel.
Ruth Silverman
University of Maryland, College Park, Maryland
and University of the District of Columbia, Washington, DC
and
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. 573­582.
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 CCR­9712379. N. Ne-

Source: Arya, Sunil - Department of Computer Science, Hong Kong University of Science and Technology
Mount, David - Institute for Advanced Computer Studies & Department of Computer Science, University of Maryland at College Park

Collections: Computer Technologies and Information Sciences