The Community for Technology Leaders
Green Image
Issue No. 02 - February (2010 vol. 32)
ISSN: 0162-8828
pp: 231-241
Song-Gang Xu , Tsinghua University, Beijing
Yun-Xiang Zhang , Tsinghua University, Beijing
Jun-Hai Yong , Tsinghua University, Beijing
A wide range of applications in computer intelligence and computer graphics require computing geodesics accurately and efficiently. The fast marching method (FMM) is widely used to solve this problem, of which the complexity is O(N\log N), where N is the total number of nodes on the manifold. A fast sweeping method (FSM) is proposed and applied on arbitrary triangular manifolds of which the complexity is reduced to O(N). By traversing the undigraph, four orderings are built to produce two groups of interfering waves, which cover all directions of characteristics. The correctness of this method is proved by analyzing the coverage of characteristics. The convergence and error estimation are also presented.
Geodesics, fast sweeping methods, fast marching methods, Eikonal equation, triangular manifold.

S. Xu, Y. Zhang and J. Yong, "A Fast Sweeping Method for Computing Geodesics on Triangular Manifolds," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 32, no. , pp. 231-241, 2008.
91 ms
(Ver 3.3 (11022016))