arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.12878cs.CG
收藏

Fréchet编辑距离

Fréchet Edit Distance

Emily Fox, Amir Nayyeri, Jonathan James Perry, Benjamin Raichel

AI总结:

本文定义了Fréchet编辑距离问题,即通过最少编辑操作使两曲线Fréchet距离不超过阈值,并给出了离散与连续变体的多项式算法及弱变体的难度结果。

摘要:

我们定义并研究了Fréchet编辑距离问题。给定两条多边形曲线π和σ以及一个阈值δ>0,我们寻求对σ进行最少次数的编辑,使得编辑后的σ与π之间的Fréchet距离至多为δ。对于编辑操作,我们考虑三种情况,即删除顶点、插入顶点,或两者兼有。针对这个基本问题,我们考虑了多种变体。具体来说,我们为离散和连续Fréchet编辑距离变体提供了多项式时间算法,以及为弱Fréchet编辑距离变体提供了难度结果。

英文摘要:

We define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ>0$, we seek the minimum number of edits to $σ$ such that the Fréchet distance between the edited $σ$ and $π$ is at most $δ$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices, or both. For this basic problem we consider a number of variants. Specifically, we provide polynomial time algorithms for both discrete and continuous Fréchet edit distance variants, as well as hardness results for weak Fréchet edit distance variants.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑