 
Summary: SpaceTime Tradeoffs for Approximate
Nearest Neighbor Searching
Sunil Arya
Dept. of Computer Science
The Hong Kong University
of Science and Technology
Theocharis Malamatos
Dept. of Computer Science
University of Peloponnese
David M. Mount§
Dept. of Computer Science &
Inst. for Adv. Computer Studies
University of Maryland
September 28, 2008
Abstract
Consider a set S of n points in real ddimensional space under the Euclidean norm. Nearest
neighbor searching is the problem of preprocessing these points so that, given any query point q,
it is possible to report the closest point of S rapidly. In approximate nearest neighbor searching,
a parameter > 0 is given, and the problem is to report any point of S whose distance from q is
within a factor of (1+) of the nearest neighbor. We assume that the dimension d is a constant
