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

Fréchet距离的再认识和推广

Fréchet Distance Revisited and Extended

Sariel Har-Peled, Benjamin Raichel

摘要:

给定R^d中的两个单纯复形,以及每个复形中的开始和结束顶点,我们展示了如何计算这些顶点之间的曲线(在每个复形中),使得这些曲线之间的Fréchet距离最小化。由于多边形曲线是一个复形,这推广了曲线之间弱Fréchet距离的常规概念。我们还推广的算法来处理k个单纯复形的输入。使用这种新算法,我们可以解决一系列新的问题,从计算给定曲线集合的平均曲线,到各种运动规划问题。此外,我们还证明了对于均值曲线问题,当k个输入曲线是c-填充的时,对于固定的k和k,可以在近线性时间内(1+ k)-逼近均值曲线。此外,我们提出了一个算法来计算两条曲线之间的强Fréchet距离,这是简单的比以前的算法,并避免使用参数搜索。

英文摘要:

Given two simplicial complexes in R^d, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Fréchet distance between these curves is minimized. As a polygonal curve is a complex, this generalizes the regular notion of weak Fréchet distance between curves. We also generalize the algorithm to handle an input of k simplicial complexes. Using this new algorithm we can solve a slew of new problems, from computing a mean curve for a given collection of curves, to various motion planning problems. Additionally, we show that for the mean curve problem, when the k input curves are c-packed, one can (1+epsilon)-approximate the mean curve in near linear time, for fixed k and epsilon. Additionally, we present an algorithm for computing the strong Fréchet distance between two curves, which is simpler than previous algorithms, and avoids using parametric search.

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

↑