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.
How difficult is it to walk the dog? In Abstracts of 23rd Europ
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Rock Climber Distance: Frogs versus Dogs
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.