Computational Study of Fast Methods for the Eikonal Equation

Authors:
Pierre A. Gremaud;Christopher M. Kuster
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2005

Citing 0
Cited 8

A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations

Journal of Scientific Computing
A study of numerical methods for the level set approach

Applied Numerical Mathematics
Properties of a Level Set Algorithm for the Visibility Problems

Journal of Scientific Computing
A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations

Journal of Scientific Computing
Solving the direction field for discrete agent motion

ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Some Improvements for the Fast Sweeping Method

SIAM Journal on Scientific Computing
Fast Two-scale Methods for Eikonal Equations

SIAM Journal on Scientific Computing
A uniformly second order fast sweeping method for eikonal equations

Journal of Computational Physics

Quantified Score

Hi-index	0.01

Visualization

Abstract

A computational study of the fast marching and the fast sweeping methods for the eikonal equation is given. It is stressed that both algorithms should be considered as "direct" (as opposed to iterative) methods. On realistic grids, fast sweeping is faster than fast marching for problems with simple geometry. For strongly nonuniform problems and/or complex geometry, the situation may be reversed. Finally, fully second order generalizations of methods of this type for problems with obstacles are proposed and implemented.