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.
25 Joachim Gudmundsson, Tiancheng Mai, and Sampson Wong
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.