Geodesic paths on triangular meshes

We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's (1996) fast marching method and Polthier's (1998) straightest geodesics theory, we are able to generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and nonconvex surfaces as well.