Sciweavers

CG
2005
Springer

Computing geodesics on triangular meshes

13 years 10 months ago
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
Dimas Martínez Morera, Luiz Velho, Paulo Ce
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where CG
Authors Dimas Martínez Morera, Luiz Velho, Paulo Cezar Pinto Carvalho
Comments (0)