COMPUTING GEODESIC PATHS ON MANIFOLDS

Authors
KIMMEL R SETHIAN JA
Citation
R. Kimmel et Ja. Sethian, COMPUTING GEODESIC PATHS ON MANIFOLDS, Proceedings of the National Academy of Sciences of the United Statesof America, 95(15), 1998, pp. 8431-8435
Citations number
9
Categorie Soggetti
Multidisciplinary Sciences
Journal title
Proceedings of the National Academy of Sciences of the United Statesof America → ACNP
ISSN journal
00278424
Volume
95
Issue
15
Year of publication
1998
Pages
8431 - 8435
Database
ISI
SICI code
0027-8424(1998)95:15<8431:CGPOM>2.0.ZU;2-R
Abstract
The Fast Marching Method is a numerical algorithm for solving the Eiko nal equation on a rectangular orthogonal mesh in O(M log M) steps, whe re hi is the total number of grid points. In this paper we extend the Fast Marching Method to triangulated domains with the same computation al complexity As an application, we provide an optimal time algorithm for computing the geodesic distances and thereby extracting shortest p aths on triangulated manifolds.