Solving Fréchet Distance Problems by Algebraic Geometric Methods
share
We study several polygonal curve problems under the Fréchet distance via algebraic geometric methods. Let 𝕏_m^d and 𝕏_k^d be the spaces of all polygonal curves of m and k vertices in ℝ^d, respectively. We assume that k ≤ m. Let ℛ^d_k,m be the set of ranges in 𝕏_m^d for all possible metric balls of polygonal curves in 𝕏_k^d under the Fréchet distance. We prove a nearly optimal bound of O(dklog (km)) on the VC dimension of the range space (𝕏_m^d,ℛ_k,m^d), improving on the previous O(d^2k^2log(dkm)) upper bound and approaching the current Ω(dklog 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.
READ FULL TEXT