Walking Your Dog in the Woods in Polynomial Time

Abstract : The Frechet distance between two curves in the plane is the minimum length of a leash that allows a dog and its owner to walk along their respective curves, from one end to the other, without backtracking. We propose a natural extension of Frechet distance to more general metric spaces, which requires the leash itself to move continuously over time. For example, for curves in the punctured plane, the leash cannot pass through or jump over the obstacles (''trees''). We describe a polynomial-time algorithm to compute the homotopic Frechet distance between two given polygonal curves in the plane minus a given set of obstacles, which are either points or polygons.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00336497
Contributor : Sylvain Lazard <>
Submitted on : Tuesday, November 4, 2008 - 11:53:37 AM
Last modification on : Thursday, February 7, 2019 - 3:01:31 PM
Long-term archiving on : Tuesday, October 9, 2012 - 3:00:18 PM

File

submission_105.pdf
Files produced by the author(s)

Identifiers

Citation

Erin Wolf Chambers, Eric Colin de Verdire, Jeff Erickson, Sylvain Lazard, Francis Lazarus, et al.. Walking Your Dog in the Woods in Polynomial Time. 24th Annual Symposium on Computational Geometry (SoCG 2008), Jun 2008, College Park, Maryland, United States. pp.101--109, ⟨10.1145/1377676.1377694⟩. ⟨inria-00336497⟩

Share

Metrics

Record views

578

Files downloads

304