Fast Marching Methods

Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static Hamilton--Jacobi equations. Based on entropy-satisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms. They are optimal in the sense that the computational complexity of the algorithms is O(N log N), where N is the total number of points in the domain. The schemes are of use in a variety of applications, including problems in shape offsetting, computing distances from complex curves and surfaces, shape-from-shading, photolithographic development, computing first arrivals in seismic travel times, construction of shortest geodesics on surfaces, optimal path planning around obstacles, and visibility and reflection calculations. In this paper, we review the development of these techniques, including the theoretical and numerical underpinnings; provide details of the computational schemes, including higher order versions; and demonstrate the techniques in a collection of different areas.

[1]  E. Rouy,et al.  A viscosity solutions approach to shape-from-shading , 1992 .

[2]  P. Lions,et al.  User’s guide to viscosity solutions of second order partial differential equations , 1992, math/9207212.

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  J. Sethian.  Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws , 1990 .

[5]  J. Sethian,et al.  A Fast Level Set Method for Propagating Interfaces , 1995 .

[6]  James A. Sethian,et al.  Theory, algorithms, and applications of level set methods for propagating interfaces , 1996, Acta Numerica.

[7]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[8]  W. Schneider.  Robust and efficient upwind finite-difference traveltime calculations in three dimensions , 1995 .

[9]  Baba C. Vemuri,et al.  Evolutionary Fronts for Topology-Independent Shape Modeling and Recoveery , 1994, ECCV.

[10]  A. Booth.  Numerical Methods , 1957, Nature.

[11]  J. Sethian,et al.  An O(N log N) algorithm for shape modeling. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[12]  P. Gács,et al.  Algorithms , 1992 .

[13]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[14]  J. Sethian,et al.  traveltime computation using the fast marching method , 1999 .

[15]  G. Sod.  Numerical methods in fluid dynamics , 1985 .

[16]  Baba C. Vemuri,et al.  Front Propagation: A Framework for Topology Independent Shape Modeling and Recovery , 1994 .

[17]  J. Sethian,et al.  Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains , 1998 .

[18]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[19]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[20]  Paul Garabedian,et al.  Lectures on partial differential equations , 1964 .

[21]  R. LeVeque.  Numerical methods for conservation laws , 1990 .

[22]  James A. Sethian,et al.  Fast-marching level-set methods for three-dimensional photolithography development , 1996, Advanced Lithography.

[23]  J. Sethian.  Curvature and the evolution of fronts , 1985 .

[24]  D. Chopp.  Computing Minimal Surfaces via Level Set Curvature Flow , 1993 .

[25]  J. Sethian.  Level set methods : evolving interfaces in geometry, fluid mechanics, computer vision, and materials science , 1996 .

[26]  P. Lions,et al.  Some Properties of Viscosity Solutions of Hamilton-Jacobi Equations. , 1984 .

[27]  J. Sethian.  AN ANALYSIS OF FLAME PROPAGATION , 1982 .

[28]  Alexander M. Popovici.  Prestack migration by split‐step DSR , 1996 .

[29]  J. Vidale.  Finite‐difference calculation of traveltimes in three dimensions , 1990 .

[30]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[31]  J. Vidale.  Finite-difference calculation of travel times , 1988 .

[32]  James A. Sethian,et al.  Numerical Methods for Propagating Fronts , 1987 .