Fast approximation of geodesic based on heuristic estimate

Geodesic computation is very important in various mesh processing techniques such as segmenting, re-meshing, parameterizing, navigating and editing. In this paper, we present a new method to quickly extract geodesic paths on 3D triangle meshes. Based on heuristic estimate and Dimas Martinez and Luiz Velho´s evolving method, we generate an iterative process to obtain a good discrete geodesic approximation. It can handle convex and non-convex surfaces. Experiment results show that our method works very well both in efficiency and precision.