非精确输入下离散Fréchet距离上界的复杂性及算法
Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input
摘要：
研究了不精确输入下离散Fréchet距离上界的计算问题，证明了该问题是NP-困难的.这解决了Ahn \emph{et al}在2010年提出的一个悬而未决的问题。如果捷径是允许的，我们表明，离散Fréchet距离的上限与捷径不精确的输入可以计算在多项式时间，我们提出了几个有效的算法。
英文摘要：
We study the problem of computing the upper bound of the discrete Fréchet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn \emph{et al}. If shortcuts are allowed, we show that the upper bound of the discrete Fréchet distance with shortcuts for imprecise input can be computed in polynomial time and we present several efficient algorithms.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
