.png){kind=icon}
Return
Computing geodesic paths on manifolds
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.95.15.8431.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Fast Marching Method is a numerical algorithm for solving the Eikonal equation on a rectangular orthogonal mesh in O(M log M) steps, where hi 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.
Keywords:
LEVEL SET METHOD
CURVATURE
FRONTS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
9.1
Papers:
10.8W
Citations:
73.5W
Organization
No organization information available
Cited Papers
No cited papers available