(1+ε)-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension

Abstract

We consider the (1 + ε)-Approximate Nearest Neighbour (ANN) Problem for polygonal curves in d-dimensional space consisting of at most k vertices under the Fréchet distance and ask to what extent known data structures for doubling spaces can be applied to this problem. Initially, this approach does not seem viable, since the doubling dimension of the target space is known to be unbounded - even for well-behaved polygonal curves of constant complexity in one dimension. In order to overcome this, we identify a subspace of curves which has bounded doubling dimension and small Gromov-Hausdorff distance to the target space.
We then apply state-of-the-art techniques for doubling spaces and show how to obtain a data structure for the (1 + ε)-ANN problem for any set of parametrized polygonal curves. The expected preprocessing time needed to construct the data-structure is F(d, k, S, ε)n log n and the space used is F(d, k, S, ε)n, with a query time of F(d, k, S, ε)log n + F(d, k, S, ε)^-log(ε), where F(d, k, S, ε) = O(2^O(d)kΦ(S)ε^-1)^k and Φ(S) denotes the spread of the set of vertices and edges of the curves in S. We extend these results to the realistic class of c-packed curves and show improved bounds for small values of c.