Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time - Archive ouverte HAL Access content directly
Journal Articles Computational Geometry Year : 2010

Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time

(1) , (2) , (3) , (4) , (5) , (6)
1
2
3
4
5
6

Abstract

The Fréchet 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 Fréchet 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 Fréchet distance between two given polygonal curves in the plane minus a given set of polygonal obstacles.
Vignette du fichier
2010 Homotopic Frechet Distance Between Curves.png (15.43 Ko) Télécharger le fichier Fichier principal
Vignette du fichier
frechet.pdf (675.3 Ko) Télécharger le fichier
Format : Figure, Image
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00438463 , version 1 (03-12-2009)

Identifiers

Cite

Erin Wolf Chambers, Eric Colin de Verdière, Jeff Erickson, Sylvain Lazard, Francis Lazarus, et al.. Homotopic Fréchet Distance Between Curves or, Walking Your Dog in the Woods in Polynomial Time. Computational Geometry, 2010, Special Issue on 24th Annual Symposium on Computational Geometry (SoCG'08), 43 (3), pp.295-311. ⟨10.1016/j.comgeo.2009.02.008⟩. ⟨inria-00438463⟩
1035 View
212 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More