A global algorithm to compute defect-tolerant geodesic distance
A global algorithm to compute defect-tolerant geodesic distance
复制标题
DOI：
10.1145/2407746.2407769
复制
发表时间：
2012-11
期刊：
影响因子：
--
通讯作者：
Shiqing Xin;D. T. P. Quynh;Xiang Ying;Ying He
中科院分区：
文献类型：
--
作者：
Shiqing Xin;D. T. P. Quynh;Xiang Ying;Ying He
曲面上测地线距离的计算在数字几何处理中起着至关重要的作用。然而，由于其局部最短的性质，测地线距离对局部几何和拓扑变化高度敏感，这限制了它在可能包含各种类型缺陷的真实世界模型中的应用。提出了一种计算破碎网格上容错测地线距离的新算法。与现有的在单次Dijkstra扫描中计算从源到目的地的距离的方法不同，我们的方法以迭代和全局的方式进行。由于其全局性质，生成的距离对某些缺陷(如洞、间隙、快捷方式)是容忍的，对网格细分/分辨率不敏感，并且对噪声具有健壮性，这提供了对破碎网格上的测地线的有意义的近似。
Computing geodesic distance on surfaces plays a critical role in digital geometry processing. However, due to its locally shortest nature, geodesic distance is highly sensitive to local geometrical and topological changes, diminishing its applications to real-world models which may contain various types of defects. This paper presents a new algorithm to compute defect-tolerant geodesic distance on broken meshes. In contrast to the existing approaches which compute the distance from source to destinations in a single Dijkstra-like sweep, our method proceeds in an iterative and global manner. Thanks to its global nature, the resulting distance is tolerant to some defects (e.g. holes, gaps, shortcuts), insensitive to mesh tessellation/resolution, and robust to noise, which provides a meaningful approximation of geodesics on broken meshes.