闭合曲线的离散Fréchet距离

IF 0.4 4区计算机科学 Q4 MATHEMATICS

Computational Geometry-Theory and Applications Pub Date : 2023-04-01 DOI:10.1016/j.comgeo.2022.101967

Evgeniy Vodolazskiy

引用次数: 0

摘要

本文给出了闭曲线之间Fréchet距离的离散变化，它可以看作是连续测度的近似值。使用二进制搜索计算m和n点的两个闭合序列之间的离散Fréchet距离的一种相当简单的方法取O（mnlog⁡mn）时间。我们提出了一个算法，该算法将O（mnlog⁡mn）时间，其中log是重对数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Discrete Fréchet distance for closed curves

The paper presents a discrete variation of the Fréchet distance between closed curves, which can be seen as an approximation of the continuous measure. A rather straightforward approach to compute the discrete Fréchet distance between two closed sequences of m and n points using binary search takes $O (m n \log m n)$ time. We present an algorithm that takes $O (m n \log^{⁎} m n)$ time, where $\log^{⁎}$ is the iterated logarithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computational Geometry-Theory and Applications 数学-数学

CiteScore

1.60

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Computational Geometry is a forum for research in theoretical and applied aspects of computational geometry. The journal publishes fundamental research in all areas of the subject, as well as disseminating information on the applications, techniques, and use of computational geometry. Computational Geometry publishes articles on the design and analysis of geometric algorithms. All aspects of computational geometry are covered, including the numerical, graph theoretical and combinatorial aspects. Also welcomed are computational geometry solutions to fundamental problems arising in computer graphics, pattern recognition, robotics, image processing, CAD-CAM, VLSI design and geographical information systems. Computational Geometry features a special section containing open problems and concise reports on implementations of computational geometry tools.