Computing geodesics on triangular meshes

We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle both convex and non-convex surfaces. Key words: shortest geodesic, manifold triangulation, curve evolution

• Type: Journal
• Year: 2005
• Where: CG
• Authors: Dimas Martínez Morera, Luiz Velho, Paulo Cezar Pinto Carvalho
• Keywords: CG 2005, Computer Graphics, Discrete Geodesic Approximation, Geodesic, Geodesic Path