Near-tight (1+ε)-approximation algorithms and OVH-based lower bounds are given for Fréchet distance on d-dimensional grid graphs, with tightness results for λ-low dense curves.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CG 2representative citing papers
Develops an exact convergent variant of the frog-based Fréchet distance algorithm with open-source code and experiments showing Bringmann et al. often faster in practice.
citing papers explorer
-
Near-tight Bounds for Computing the Fr\'echet Distance in d-Dimensional Grid Graphs and the Implications for {\lambda}-low Dense Curves
Near-tight (1+ε)-approximation algorithms and OVH-based lower bounds are given for Fréchet distance on d-dimensional grid graphs, with tightness results for λ-low dense curves.
-
On computing the (exact) Fr\'echet distance with a frog
Develops an exact convergent variant of the frog-based Fréchet distance algorithm with open-source code and experiments showing Bringmann et al. often faster in practice.