Computing geodesic paths on manifolds

被引：735

作者：

Kimmel, R

Sethian, JA ^{[1
]}

机构：

[1] Univ Calif Berkeley, Dept Math, Berkeley, CA 94720 USA

[2] Univ Calif Berkeley, Lawrence Berkeley Lab, Berkeley, CA 94720 USA

来源：

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | 1998年 / 95卷 / 15期

关键词：

D O I：

10.1073/pnas.95.15.8431

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

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.

引用

页码：8431 / 8435

页数：5

共 9 条

[1] A FAST LEVEL SET METHOD FOR PROPAGATING INTERFACES [J].