Abstract:
Fast Marching Methods are numerical schemes for computing solutions to the non-linear Eikonal equation and related static HamiltonJacobi equations. Based on entropy-satisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly ecient 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 osetting, computing distances from complex curves and surfaces, shape-from-shading, photolithographic development, computing rst arrivals in seismic travel times, construction of shortest geodesics on surfaces, optimal path planning around obstacles, and visibility and re
ection 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 dierent areas.
Citations
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
1560
|
Robot Motion Planning
– Latombe
- 1991
|
|
554
|
Fronts propagation with curvature dependent speed: Algorithms based on Hamilton-Jacobi formulations
– Osher, Sethian
- 1988
|
|
221
|
Numerical Methods for Conservation Laws
– LeVeque
- 1990
|
|
212
|
A fast marching level set method for monotonically advancing fronts
– Sethian
- 1996
|
|
196
|
A fast level set method for propagating interfaces
– Adalsteinsson, Sethian
- 1995
|
|
152
|
Set Methods: Evolving Interfaces
– Sethian, Level
- 1996
|
|
151
|
Set Methods and Fast Marching Methods: Evolving
– Level
- 1999
|
|
121
|
A viscosity solutions approach to shape-fromshading
– Rouy, Tourin
- 1992
|
|
84
|
Some properties of viscosity solutions of Hamilton-Jacobi equations
– Crandall, Evans, et al.
- 1984
|
|
82
|
A Note on Two
– Dijkstra
|
|
77
|
Computing minimal surfaces via level set curvature ow
– Chopp
- 1993
|
|
67
|
Curvature and the evolution of fronts
– Sethian
- 1985
|
|
39
|
Evolutionary fronts for topology-independent shape modeling and recovery
– Malladi, Sethian, et al.
- 1994
|
|
35
|
Numerical algorithms for propagating interfaces: Hamilton-Jacobi equations and conservation laws
– Sethian
- 1990
|
|
33
|
An analysis of flame propagation
– Sethian
- 1982
|
|
26
|
Numerical schemes for the Hamilton–Jacobi and level set equations on triangulated domains
– Barth, Sethian
- 1998
|
|
22
|
Finite-difference calculation of travel times
– Vidale
- 1988
|
|
21
|
Fast marching level set methods for three-dimensional photolithography development
– Sethian
- 1996
|
|
19
|
An O(N log N) algorithm for shape modeling
– Malladi, Sethian
- 1996
|
|
19
|
Finite-difference calculation of traveltimes in three dimensions
– Vidale
- 1990
|
|
18
|
Numerical Methods in Fluid Dynamics
– Sod
- 1985
|
|
16
|
Three dimensional traveltimes computation using the fast marching method
– Sethian, Popovici
- 1999
|
|
11
|
Fast marching methods on triangulated domains
– Kimmel, Sethian
- 1998
|
|
8
|
Prestack migration by split-step DSR
– Popovici
- 1996
|
|
8
|
Numerical methods for propagating fronts, in Variational methods for free surface interfaces, edited by P
– Sethian
- 1987
|
|
6
|
Partial dierential equations
– Garabedian
- 1964
|
|
5
|
User’s Guide to Viscosity
– Crandall, Ishii, et al.
- 1992
|
|
3
|
Fast Marching Methods for Robotic Navigation with Constraints, Center for Pure and Applied Mathematics Report
– Kimmel, Sethian
- 1996
|
|
2
|
Computing and Imaging using Fast Marching
– Corporation
- 1998
|
|
2
|
Upwind Finite-dierence
– Trier, Symes
- 1991
|
|
1
|
Modern Numerical Methods for Fluid Flow, Lecture Notes
– Colella, Puckett
- 1994
|
|
1
|
Viscosity
– Crandall, Lions
- 1983
|
|
1
|
Robust and ecient upwind traveltime calculations in three dimensions
– Schneider
- 1995
|
|
1
|
Extensions to Triangulated Fast Marching Methods
– Vladimirsky
- 1998
|
|
