Year: 2017
Type: article
Abstract: 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 achieves this task with n^{k+1}(log(n)/epsilon)^O(1) storage and preprocessing (where the constant of proportionality in the big-O notation depends on d), and can answer a query in O(polylog(n)) time (where the power of the logarithm depends on d and k). In particular, we need only near-quadratic storage to answer ANN queries amidst a set of n lines in any fixed-dimensional Euclidean space. As a by-product, our approach also yields an algorithm, with similar performance bounds, for answering exact nearest neighbor queries amidst k-flats with respect to any polyhedral distance function. Our results are more general, in that they also provide a tradeoff between storage and query time.
Parent work: LIPIcs, Volume 87, ESA'17, Complete Volume
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G2504493701, Combinatorial Aspects of Computational Geometry, G4252697786, G434337789, AF: Medium: Collaborative Research: Algorithmic Foundations for Trajectory Collection Analysis, G6711570349, G7965623349, G8257659198, AF:Medium:Collaborative Research: Uncertainty Aware Geometric Computing
OpenAlex ID: W2756582102
