Aviv University, and by the Hermann Minkowski-MINERVA Center for Geometry at Tel Aviv University 3 Pankaj K. Agarwal 4 Micha Sharir Let T = {41, . . . , 4n} be a set of of n pairwise-disjoint triangles
We consider the Approximate Nearest Neighbor (ANN) problem where the input set consists of n k-flats in the Euclidean Rd, for any fixed parameters k<d, and where, for each query point q, we want to return an input flat whose distance from q is at most (1 + epsilon) times the shortest such distance, where epsilon > 0 is another prespecified parameter. We present an algorithm that...
