arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.5333cs.CG
收藏

次二次时间上离散Fréchet距离的计算

Computing the Discrete Fréchet Distance in Subquadratic Time

Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir

摘要:

弗雷歇距离是两条曲线$A$和$B$之间的相似性度量:非正式地,它是连接狗(被约束为在$A$上)和其主人(被约束为在$B$上)所需的皮带的最小长度,因为它们沿着各自的曲线从一个端点到另一个端点行走而不回溯。这种度量相对于其他度量(如Hausdorff距离)的优势在于它考虑了曲线上点的排序。离散的Fréchet距离将狗和它的主人替换为一对青蛙,这对青蛙只能分别驻留在曲线$A$和$B$上的$n$和$m$特定的鹅卵石上。这些青蛙从一个鹅卵石跳到另一个鹅卵石,没有回头路。离散Fréchet距离可以通过相当简单的二次动态规划算法来计算。然而,尽管有相当多的工作在这个问题及其变化,有没有次二次算法已知,即使是近似版本的问题。在本文中,我们提出了一个次二次算法计算离散Fréchet距离之间的两个序列的点在平面上,各自的长度$m\le n$。该算法在$O(\dfrac{mn\log\log n}{\log n})$时间内运行,并使用$O(n+m)$存储。我们的方法使用几何的问题,以一种微妙的方式编码的青蛙作为一个有限自动机的状态的法律地位。

英文摘要:

The Fréchet distance is a similarity measure between two curves $A$ and $B$: Informally, it is the minimum length of a leash required to connect a dog, constrained to be on $A$, and its owner, constrained to be on $B$, as they walk without backtracking along their respective curves from one endpoint to the other. The advantage of this measure on other measures such as the Hausdorff distance is that it takes into account the ordering of the points along the curves. The discrete Fréchet distance replaces the dog and its owner by a pair of frogs that can only reside on $n$ and $m$ specific pebbles on the curves $A$ and $B$, respectively. These frogs hop from a pebble to the next without backtracking. The discrete Fréchet distance can be computed by a rather straightforward quadratic dynamic programming algorithm. However, despite a considerable amount of work on this problem and its variations, there is no subquadratic algorithm known, even for approximation versions of the problem. In this paper we present a subquadratic algorithm for computing the discrete Fréchet distance between two sequences of points in the plane, of respective lengths $m\le n$. The algorithm runs in $O(\dfrac{mn\log\log n}{\log n})$ time and uses $O(n+m)$ storage. Our approach uses the geometry of the problem in a subtle way to encode legal positions of the frogs as states of a finite automata.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑