使用快捷方式计算Fréchet距离是NP难的
Computing the Fréchet distance with shortcuts is NP-hard
摘要:
我们研究了Fréchet距离的捷径,Fréchet距离的一个自然变体,它允许我们从任何一条曲线上的任何一点走捷径。经典的Fréchet距离是一个瓶颈距离度量,因此对离群值非常敏感。快捷Fréchet距离允许我们跨越离群值,从而在处理真实世界数据时产生更有意义的结果。Driemel和Har-Peled最近描述了用于限制情况的近似算法,其中快捷方式必须在输入顶点处开始和结束。我们表明,在一般情况下,计算快捷Fréchet距离的问题是NP-困难的。这是平面中两条多边形曲线之间Fréchet距离的变体的第一个硬度结果。我们还提出了两个算法的决策问题:3-近似算法的一般情况下,顶点限制的情况下,一个精确的算法。时间复杂度为O(n^3 log n)
英文摘要:
We study the shortcut Fréchet distance, a natural variant of the Fréchet distance, that allows us to take shortcuts from and to any point along one of the curves. The classic Fréchet distance is a bottle-neck distance measure and hence quite sensitive to outliers. The shortcut Fréchet distance allows us to cut across outliers and hence produces significantly more meaningful results when dealing with real world data. Driemel and Har-Peled recently described approximation algorithms for the restricted case where shortcuts have to start and end at input vertices. We show that, in the general case, the problem of computing the shortcut Fréchet distance is NP-hard. This is the first hardness result for a variant of the Fréchet distance between two polygonal curves in the plane. We also present two algorithms for the decision problem: a 3-approximation algorithm for the general case and an exact algorithm for the vertex-restricted case. Both algorithms run in O(n^3 log n) time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。