Solving Fréchet Distance Problems by Algebraic Geometric Methods

Abstract

We study several polygonal curve problems under the Fréchet distance via algebraic geometric methods. Let ${\mathbb{X}}_m^d$ and ${\mathbb{X}}_k^d$ be the spaces of all polygonal curves of $m$ and $k$ vertices in ${\mathbb{R}}^d$, respectively. We assume that $k\le m$. Let ${\mathcal{R}}_{k,m}^d$ be the set of ranges in ${\mathbb{X}}_m^d$ for all possible metric balls of polygonal curves in ${\mathbb{X}}_k^d$ under the Fréchet distance. We prove a nearly optimal bound of $O(dk\log (km))$ on the VC dimension of the range space $({\mathbb{X}}_m^d,{\mathcal{R}}_{k,m}^d)$, improving on the previous $O(d^2{k}^2\log (dkm))$ upper bound and approaching the current $\Omega (dk\log k)$ lower bound. Our upper bound also holds for the weak Fréchet distance. We also obtain exact solutions that are hitherto unknown for curve simplification, range searching, nearest neighbor search, and distance oracle.

arXiv commentTo appear at SODA24, correct some references