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 条

[1]

Accisano P., 2014, CORR ARXIV14044859 A

[2]

Accisano P., 2014, CORR ARXIV14050762 A

[3]

Accisano P., 2014, P 26 CANADIAN C COMP, P443

[4]

Agarwal PK, 2013, PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), P156

[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., 1991, Proceedings of the 7th Annual Symposium on Computational Geometry, SoCG '91, P186

[7]

[Anonymous], 1994, COMPUTING DISCRETE F

[8]

[Anonymous], 1981, 7 WORKSH GRAPH THEOR

[9] Polynomial time approximation schemes for euclidean TSP and other geometric problems [J].

Arora, S .

37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, :2-11

[10]

Berman P., 2003, ELECT C COMPUTATIONA

← 1 2 →