Defines rock climber and k-station distances for polygonal chains with alternating agent moves, proves equivalence to Fréchet or Hausdorff for unlimited moves, shows NP-hardness for fixed k, and gives a 2-approximation for the minimum k achieving a distance threshold.
Four Sovi- ets walk the dog: Improved bounds for computing the Fr´ echet distance
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
The paper delivers a chronological history of Fréchet distances connecting early abstract set theory to curve metrics, optimal transport, and the FID metric in generative models.
citing papers explorer
No citing papers match the current filters.