13,004 research outputs found
How to Walk Your Dog in the Mountains with No Magic Leash
We describe a -approximation algorithm for computing the
homotopic \Frechet distance between two polygonal curves that lie on the
boundary of a triangulated topological disk. Prior to this work, algorithms
were known only for curves on the Euclidean plane with polygonal obstacles.
A key technical ingredient in our analysis is a -approximation
algorithm for computing the minimum height of a homotopy between two curves. No
algorithms were previously known for approximating this parameter.
Surprisingly, it is not even known if computing either the homotopic \Frechet
distance, or the minimum height of a homotopy, is in NP
- …