Homotopic Frechet distance between curves or, walking your dog in the woods in polynomial time

被引:39
作者
Chambers, Erin Wolf [8 ]
de Verdiere, Eric Colin [6 ,7 ]
Erickson, Jeff [5 ]
Lazard, Sylvain [4 ]
Lazarus, Francis [2 ,3 ]
Thite, Shripad [1 ]
机构
[1] CALTECH, Ctr Math Informat, Pasadena, CA 91125 USA
[2] GIPSA Lab, Grenoble, France
[3] CNRS, Grenoble, France
[4] LORIA, INRIA Nancy Grand Est, Nancy, France
[5] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
[6] Ecole Normale Super, Dept Informat, F-75231 Paris, France
[7] CNRS, Paris, France
[8] St Louis Univ, Dept Math & Comp Sci, St Louis, MO 63103 USA
来源
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2010年 / 43卷 / 03期
关键词
Homotopy; Similarity of curves; Metric space; Homotopic Frechet distance; Geodesic leash map; Punctured plane; EUCLIDEAN SHORTEST PATHS; QUERIES;
D O I
10.1016/j.comgeo.2009.02.008
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 polygonal obstacles. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:295 / 311
页数:17
相关论文
共 31 条
  • [1] COMPUTING THE FRECHET DISTANCE BETWEEN 2 POLYGONAL CURVES
    ALT, H
    GODAU, M
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (1-2) : 75 - 91
  • [2] Alt Helmut., 2005, Proc. 21st European Workshop on Computational Geometry, P45
  • [3] [Anonymous], P 23 ANN S FDN COMP
  • [4] Aronov B, 2006, LECT NOTES COMPUT SC, V4168, P52
  • [5] Encoding homotopy of paths in the plane
    Bespamyatnikh, S
    [J]. LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 329 - 338
  • [6] Bespamyatnikh S, 2003, SIAM PROC S, P609
  • [7] Testing homotopy for paths in the plane
    Cabello, S
    Liu, YX
    Mantler, A
    Snoeyink, J
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 31 (01) : 61 - 81
  • [8] CHAMBERS EW, 2008, THESIS U ILLINOIS UR
  • [9] CHEW LP, 1989, ALGORITHMICA, V4, P97, DOI 10.1007/BF01553881
  • [10] PARALLEL MERGE SORT
    COLE, R
    [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (04) : 770 - 785