SETH说:弱Fréchet距离更快,但只有当它是连续的和在一维
SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
摘要:
我们表明,减少从正交向量的问题,算法与强次二次运行时间不能近似曲线之间的Fréchet距离优于一个因素$3$,除非SETH失败。我们发现,类似的减少不能达到一个比$3$更好的因素的下限。我们的下界保持连续的,离散的,和弱离散Fréchet距离,甚至在一维曲线。有趣的是,连续弱Fréchet距离的行为不同。我们的下限仍然适用于二维和更高维的曲线。然而,对于一维曲线,我们提供了一个精确的算法来计算弱Fréchet距离在线性时间。
英文摘要:
We show by reduction from the Orthogonal Vectors problem that algorithms with strongly subquadratic running time cannot approximate the Fréchet distance between curves better than a factor $3$ unless SETH fails. We show that similar reductions cannot achieve a lower bound with a factor better than $3$. Our lower bound holds for the continuous, the discrete, and the weak discrete Fréchet distance even for curves in one dimension. Interestingly, the continuous weak Fréchet distance behaves differently. Our lower bound still holds for curves in two dimensions and higher. However, for curves in one dimension, we provide an exact algorithm to compute the weak Fréchet distance in linear time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。