arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0703011cs.CGcs.CC
收藏

我们可以计算曲面之间的相似性吗?

Can we Compute the Similarity Between Surfaces?

Helmut Alt, Maike Buchin

摘要:

由参数化曲线或曲面表示的形状的相似性的合适度量是Fréchet距离。虽然已知有效的算法用于计算多边形曲线的Fréchet距离,但三角化曲面的相同问题是NP难的。此外,它是否是可计算的仍然是开放的。在这里,使用离散近似,我们表明它是{ \em上半可计算的},即,有一个不停机的图灵机,它产生一个收敛到结果的有理数的单调递减序列。因此,判定问题,即两个给定曲面的Fréchet距离是否低于某个指定值,是递归可逼近的。此外,我们表明,一个宽松的版本的问题,计算{ \em弱Fréchet距离}可以解决在多项式时间。为此,我们给出了一个可计算的表征弱Fréchet距离的几何数据结构称为{ \em自由空间图}。

英文摘要:

A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fréchet distance. Whereas efficient algorithms are known for computing the Fréchet distance of polygonal curves, the same problem for triangulated surfaces is NP-hard. Furthermore, it remained open whether it is computable at all. Here, using a discrete approximation we show that it is {\em upper semi-computable}, i.e., there is a non-halting Turing machine which produces a monotone decreasing sequence of rationals converging to the result. It follows that the decision problem, whether the Fréchet distance of two given surfaces lies below some specified value, is recursively enumerable. Furthermore, we show that a relaxed version of the problem, the computation of the {\em weak Fréchet distance} can be solved in polynomial time. For this, we give a computable characterization of the weak Fréchet distance in a geometric data structure called the {\em free space diagram}.

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

↑