HOME
OVERVIEW APPLICATIONS INTERACTIVE APPLETS HISTORY OF THE METHODS/FLOW CHART PUBLICATIONS EDUCATIONAL MATERIAL ACKNOWLEDGEMENTS ABOUT THE AUTHOR/CV Copyright: 1996, 1999, 2006 J.A. Sethian 
Applications to Geodesics


AbstractThe Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M \log M) steps, where M is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computational complexity. As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest paths on triangulated manifolds.
Download publications