Some improvements of the fast marching method

被引:173
作者
Chopp, DL [1 ]
机构
[1] Northwestern Univ, Dept Engn Sci & Appl Math, Evanston, IL 60208 USA
关键词
fast marching method; level set method; bicubic interpolation; reinitialization;
D O I
10.1137/S106482750037617X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The fast marching method published by Sethian [ Proc. Natl. Acad. Sci. USA, 93 ( 1996), pp. 1591-1595] is an optimally efficient algorithm for solving problems of front volution where the front speed is monotonic. It has been used in a wide variety of applications such as robotic path planning [R. Kimmel and J. Sethian, Fast Marching Methods for Computing Distance Maps and Shortest Paths, Tech. Report 669, CPAM, University of California, Berkeley, 1996], crack propagation [M. Stolarska et al., Internat. J. Numer. Methods Engrg., 51 ( 2001), pp. 943-960; N. Sukumar, D. L. Chopp, and B. Moran, Extended finite element method and fast marching method for three-dimensional fatigue crack propagation, J. Comput. Phys., submitted], seismology [ J. Sethian and A. Popovici, Geophysics, 64 (1999), pp. 516-523], photolithography [ J. Sethian, Fast marching level set methods for three-dimensional photolithography development, in Proceedings of the SPIE 1996 International Symposium on Microlithography, Santa Clara, CA, 1996], and medical imaging [ R. Malladi and J. Sethian, Proc. Natl. Acad. Sci. USA, 93 ( 1996), pp. 9389-9392]. It has also been a valuable tool for the implementation of modern level set methods where it is used to efficiently compute the distance to the front and/or an extended velocity function. In this paper, we improve upon the second order fast marching method of Sethian [SIAM Rev., 41 ( 1999), pp. 199-235] by constructing a second order approximation of the interface generated from local data on the mesh. The data is interpolated on a single box of the mesh using a bicubic approximation. The distance to the front is then calculated by using a variant of Newtons method to solve both the level curve equation and the orthogonality condition for the nearest point to a given node. The result is a second order approximation of the distance to the interface which can then be used to produce second order accurate initial conditions for the fast marching method and a third order fast marching method.
引用
收藏
页码:230 / 244
页数:15
相关论文
共 18 条
[1]   A FAST LEVEL SET METHOD FOR PROPAGATING INTERFACES [J].
ADALSTEINSSON, D ;
SETHIAN, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1995, 118 (02) :269-277
[2]   The fast construction of extension velocities in level set methods [J].
Adalsteinsson, D ;
Sethian, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1999, 148 (01) :2-22
[3]   COMPUTING MINIMAL-SURFACES VIA LEVEL SET CURVATURE FLOW [J].
CHOPP, DL .
JOURNAL OF COMPUTATIONAL PHYSICS, 1993, 106 (01) :77-91
[4]  
Dijkstra E.W., 1959, Numerische mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[5]   Robust computational algorithms for dynamic interface tracking in three dimensions [J].
Glimm, J ;
Grove, JW ;
Li, XL ;
Tan, DC .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2000, 21 (06) :2240-2256
[6]   SHAPE OFFSETS VIA LEVEL SETS [J].
KIMMEL, R ;
BRUCKSTEIN, AM .
COMPUTER-AIDED DESIGN, 1993, 25 (03) :154-162
[7]  
KIMMEL R, 1996, 669 CPAM U CAL
[8]   An O(N log N) algorithm for shape modeling [J].
Malladi, R ;
Sethian, JA .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) :9389-9392
[9]   FRONTS PROPAGATING WITH CURVATURE-DEPENDENT SPEED - ALGORITHMS BASED ON HAMILTON-JACOBI FORMULATIONS [J].
OSHER, S ;
SETHIAN, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1988, 79 (01) :12-49
[10]  
Sethian J.A., 1996, Level Set Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science