Comparison of distance measures for planar curves

被引:69
作者
Alt, H
Knauer, C
Wenk, C
机构
[1] Free Univ Berlin, Inst Informat, D-14195 Berlin, Germany
[2] Univ Arizona, Dept Comp Sci, Tucson, AZ 85721 USA
关键词
computational geometry; planar curves; Hausdorff distance; Frechet distance;
D O I
10.1007/s00453-003-1042-5
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The Hausdorff distance is a very natural and straightforward distance measure for comparing geometric shapes like curves or other compact sets. Unfortunately, it is not an appropriate distance measure in some cases. For this reason, the Frechet distance has been investigated for measuring the resemblance of geometric shapes which avoids the drawbacks of the Hausdorff distance. Unfortunately, it is much harder to compute. Here we investigate under which conditions the two distance measures approximately coincide, i.e., the pathological cases for the Hausdorff distance cannot occur. We show that for closed convex curves both distance measures are the same. Furthermore, they are within a constant factor of each other for so-called kappa-straight curves, i.e., curves where the arc length between any two points on the curve is at most a constant kappa times their Euclidean distance. Therefore, algorithms for computing the Hausdorff distance can be used in these cases to get exact or approximate computations of the Frechet distance, as well.
引用
收藏
页码:45 / 58
页数:14
相关论文
共 15 条
[1]  
AGARWAL PK, 2002, B0203 FREIE U BERL F
[2]   Generalized self-approaching curves [J].
Aichholzer, O ;
Aurenhammer, F ;
Icking, C ;
Klein, R ;
Langetepe, E ;
Rote, G .
DISCRETE APPLIED MATHEMATICS, 2001, 109 (1-2) :3-24
[3]   APPROXIMATE MATCHING OF POLYGONAL SHAPES [J].
ALT, H ;
BEHRENDS, B ;
BLOMER, J .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 13 (3-4) :251-265
[4]  
ALT H, 1990, LECT NOTES COMPUT SC, V443, P703
[5]   COMPUTING THE FRECHET DISTANCE BETWEEN 2 POLYGONAL CURVES [J].
ALT, H ;
GODAU, M .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (1-2) :75-91
[6]  
Alt Helmut, 2001, P 17 EUR WORKSH COMP, P166
[7]   IMPROVED ALGORITHMS FOR DISKS AND BALLS USING POWER DIAGRAMS [J].
AURENHAMMER, F .
JOURNAL OF ALGORITHMS, 1988, 9 (02) :151-161
[8]   COMPUTING A FACE IN AN ARRANGEMENT OF LINE SEGMENTS AND RELATED PROBLEMS [J].
CHAZELLE, B ;
EDELSBRUNNER, H ;
GUIBAS, L ;
SHARIR, M ;
SNOEYINK, J .
SIAM JOURNAL ON COMPUTING, 1993, 22 (06) :1286-1302
[9]  
Godau M., 1999, THESIS FREIE U BERLI
[10]   ON THE GENERAL MOTION-PLANNING PROBLEM WITH 2 DEGREES OF FREEDOM [J].
GUIBAS, LJ ;
SHARIR, M ;
SIFRONY, S .
DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) :491-521