An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes

As a fundamental concept, geodesics play an important role in many geometric modeling applications. However, geodesics are highly sensitive to topological changes; a small topological shortcut may result in a significantly large change of geodesic distance and path. Most of the existing discrete geodesic algorithms can only be applied to noise-free meshes. In this paper, we present a new algorithm to compute the meaningful approximate geodesics on polygonal meshes with holes. Without the explicit hole filling, our algorithm is completely intrinsic and independent of the embedding space; thus, it has the potential for isometrically deforming objects as well as meshes in high dimensional space. Furthermore, our method can guarantee the exact solution if the surface is developable. We demonstrate the efficacy of our algorithm in both real-world and synthetic models.

[1]  Xue-Cheng Tai,et al.  A Level Set Formulation of Geodesic Curvature Flow on Simplicial Surfaces , 2010, IEEE Transactions on Visualization and Computer Graphics.

[2]  Marcel Campen,et al.  Walking On Broken Mesh: Defect‐Tolerant Geodesic Distances and Parameterizations , 2011, Comput. Graph. Forum.

[3]  Atlas F. Cook,et al.  Shortest Path Problems on a Polyhedral Surface , 2009, Algorithmica.

[4]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[5]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Shi-Qing Xin,et al.  Improving Chen and Han's algorithm on the discrete geodesic problem , 2009, TOGS.

[7]  Alexander M. Bronstein,et al.  Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.

[8]  Michael Barbehenn,et al.  A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices , 1998, IEEE Trans. Computers.

[9]  Kai Tang,et al.  Construction of Iso-Contours, Bisectors, and Voronoi Diagrams on Triangulated Surfaces , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Jorge Nocedal,et al.  On the limited memory BFGS method for large scale optimization , 1989, Math. Program..

[11]  S. Gortler,et al.  Fast exact and approximate geodesics on meshes , 2005, SIGGRAPH 2005.

[12]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[13]  Konrad Polthier,et al.  Geodesic Flow on Polyhedral Surfaces , 1999 .

[14]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[15]  David A. Forsyth,et al.  Generalizing motion edits with Gaussian processes , 2009, ACM Trans. Graph..

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[17]  Shi-Qing Xin,et al.  Efficiently computing geodesic offsets on triangle meshes by the extended Xin-Wang algorithm , 2011, Comput. Aided Des..

[18]  Joseph S. B. Mitchell,et al.  New results on shortest paths in three dimensions , 2004, SCG '04.

[19]  Chi-Wing Fu,et al.  Efficiently Computing Exact Geodesic Loops within Finite Steps , 2012, IEEE Transactions on Visualization and Computer Graphics.

[20]  Micha Sharir,et al.  An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions , 2008, Discret. Comput. Geom..

[21]  Shi-Qing Xin,et al.  Constant-time O(1) all pairs geodesic distance query on triangle meshes , 2011, SA '11.