COMPUTING THE FRECHET DISTANCE BETWEEN 2 POLYGONAL CURVES

被引:682
作者
ALT, H [1 ]
GODAU, M [1 ]
机构
[1] FREE UNIV BERLIN, FACHBEREICH MATH & INFORMAT, D-14195 BERLIN, GERMANY
关键词
FRECHET DISTANCE; SHAPE ANALYSIS; RESEMBLANCE OF CURVES; COMPUTATIONAL MORPHOLOGY;
D O I
10.1142/S0218195995000064
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
As a measure for the resemblance of curves in arbitrary dimensions we consider the so-called Frechet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q consisting of p and q edges an algorithm of runtime O(pq log(pq)) measuring the Frechet-distance between P and Q is developed. Then some important variants are considered, namely the Frechet-distance for closed curves, the nonmonotone Frechet-distance and a distance function derived from the Frechet-distance measuring whether P resembles some part of the curve Q.
引用
收藏
页码:75 / 91
页数:17
相关论文
共 15 条
[1]   PARALLEL MERGE SORT [J].
COLE, R .
SIAM JOURNAL ON COMPUTING, 1988, 17 (04) :770-785
[2]   SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS [J].
COLE, R .
JOURNAL OF THE ACM, 1987, 34 (01) :200-208
[3]  
Ewing G.M., 1985, CALCULUS VARIATIONS
[4]  
Frechet M.M., 1906, RENDICONTI CIRCOLO M, V22, P1, DOI [10.1007/BF03018603, DOI 10.1007/BF03018603]
[5]   MOUNTAIN CLIMBING, LADDER MOVING, AND THE RING-WIDTH OF A POLYGON [J].
GOODMAN, JE ;
PACH, J ;
YAP, CK .
AMERICAN MATHEMATICAL MONTHLY, 1989, 96 (06) :494-510
[6]  
GUIBAS LJ, 1991, LECT NOTES COMPUT SC, V557, P151
[7]   APPLYING PARALLEL COMPUTATION ALGORITHMS IN THE DESIGN OF SERIAL ALGORITHMS [J].
MEGIDDO, N .
JOURNAL OF THE ACM, 1983, 30 (04) :852-865
[8]  
Stein C, 2001, INTRO ALGORITHMS 2 V, Vsecond
[9]  
[No title captured]
[10]  
[No title captured]