Computing geodesic paths on manifolds.

@article{Kimmel1998ComputingGP,
  title={Computing geodesic paths on manifolds.},
  author={Ron Kimmel and James A. Sethian},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={1998},
  volume={95 15},
  pages={8431-5}
}
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 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. 
Highly Influential
This paper has highly influenced 72 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,068 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 23 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 578 extracted citations

1,069 Citations

050100'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 1,069 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…