We present a new algorithm to compute a geodesic path over a
triangulated surface. Based in 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 convex and non-convex surfaces as well.