近似线性时间下真实曲线的Fréchet距离
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time
摘要:
提出了一种简单实用的曲线间Frechet距离的$(1+\eps)$ -近似算法。为了分析这个算法,我们引入了一个新的现实家庭的曲线,$c$包装曲线,这是封闭的简化。我们相信$c$ -填充曲线的概念是独立的兴趣。我们表明,我们的算法具有接近线性的运行时间$c$包装曲线,并显示类似的结果,为其他输入模型。
英文摘要:
We present simple and practical $(1+\eps)$-approximation algorithm for the Frechet distance between curves. To analyze this algorithm we introduce a new realistic family of curves, $c$-packed curves, that is closed under simplification. We believe the notion of $c$-packed curves to be of independent interest. We show that our algorithm has near linear running time for $c$-packed curves, and show similar results for other input models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。