Fréchet Edit Distance
arxiv(2024)
摘要
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 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要