Computing Geodesic Paths on Manifolds

Computing Geodesic Paths on Manifolds,10.1073/pnas.95.15.8431,Proceedings of The National Academy of Sciences,R. Kimmel,J. A. Sethian

Computing Geodesic Paths on Manifolds   (Citations: 321)
BibTex | RIS | RefWorks Download
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(MlogM) 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.
Journal: Proceedings of The National Academy of Sciences - PNAS , vol. 95, no. 15, pp. 8431-8435, 1998
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: