Frechet distance between two point sets

被引:4
作者
Buchin, Maike [1 ]
Kilgus, Bernhard [1 ]
机构
[1] Ruhr Univ Bochum, Dept Math, Bochum, Germany
来源
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2022年 / 102卷
关键词
Frechet distance; Similarity between point sets; DOG;
D O I
10.1016/j.comgeo.2021.101842
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We define and study the Frechet distance and the discrete Frechet distance between two point sets in the plane. One problem based on the well-known Frechet distance is to find a polygonal curve on a point set with small Frechet distance or small discrete Frechet distance to another given polygonal curve. Here, we consider two given point sets and ask if permutations of these point sets exist, such that the Frechet distance or the discrete Frechet distance of curves defined by the permutations is small. (c) 2021 Published by Elsevier B.V.
引用
收藏
页数:12
相关论文
共 17 条
[11]   Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails [J].
Bringmann, Karl .
2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, :661-670
[12]   Four Soviets Walk the Dog: Improved Bounds for Computing the Frechet Distance [J].
Buchin, Kevin ;
Buchin, Maike ;
Meulemans, Wouter ;
Mulzer, Wolfgang .
DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 58 (01) :180-216
[13]  
Buchin M., 2020, P 32 CANADIAN C COMP, P249
[14]   Distance measures for point sets and their computation [J].
Eiter, T ;
Mannila, H .
ACTA INFORMATICA, 1997, 34 (02) :109-133
[15]  
Maheshwari A., 2011, P 23 CAN C COMP GEOM
[16]  
Shamos MI, 1976, 17TH P ANN IEEE S F, P208
[17]   Following a curve with the discrete Frechet distance [J].
Wylie, Tim ;
Zhu, Binhai .
THEORETICAL COMPUTER SCIENCE, 2014, 556 :34-44