Fast Sweeping Methods for Static Hamilton--Jacobi Equations

Authors:
Chiu-Yen Kao;Stanley Osher;Yen-Hsi Tsai
Affiliations:
-;-;-
Venue:
SIAM Journal on Numerical Analysis
Year:
2004

Citing 0
Cited 25

Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension

Journal of Computational Physics
A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations

Journal of Scientific Computing
A second order discontinuous Galerkin fast sweeping method for Eikonal equations

Journal of Computational Physics
Properties of a Level Set Algorithm for the Visibility Problems

Journal of Scientific Computing
Legendre-transform-based fast sweeping methods for static Hamilton-Jacobi equations on triangulated meshes

Journal of Computational Physics
Integral invariants for robust geometry processing

Computer Aided Geometric Design
A Schrödinger Equation for the Fast Computation of Approximate Euclidean Distance Functions

SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Fast sweeping method for the factored eikonal equation

Journal of Computational Physics
An anisotropic multi-front fast marching method for real-time simulation of cardiac electrophysiology

FIMH'07 Proceedings of the 4th international conference on Functional imaging and modeling of the heart
A recursive anisotropic fast marching approach to reaction diffusion equation: application to tumor growth modeling

IPMI'07 Proceedings of the 20th international conference on Information processing in medical imaging
Finsler tractography for white matter connectivity analysis of the cingulum bundle

MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention - Volume Part I
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications

SIAM Review
Some Improvements for the Fast Sweeping Method

SIAM Journal on Scientific Computing
Visual Computing in Biology and Medicine: A multi-front eikonal model of cardiac electrophysiology for interactive simulation of radio-frequency ablation

Computers and Graphics
Factored singularities and high-order Lax-Friedrichs sweeping schemes for point-source traveltimes and amplitudes

Journal of Computational Physics
Uniformly Accurate Discontinuous Galerkin Fast Sweeping Methods for Eikonal Equations

SIAM Journal on Scientific Computing
A Third Order Accurate Fast Marching Method for the Eikonal Equation in Two Dimensions

SIAM Journal on Scientific Computing
The use of a Legendre pseudospectral viscosity technique to solve a class of nonlinear dynamic Hamilton-Jacobi equations

Computers & Mathematics with Applications
An Ordered Upwind Method with Precomputed Stencil and Monotone Node Acceptance for Solving Static Convex Hamilton-Jacobi Equations

Journal of Scientific Computing
The Chebyshev spectral viscosity method for the time dependent Eikonal equation

Mathematical and Computer Modelling: An International Journal
Fast Two-scale Methods for Eikonal Equations

SIAM Journal on Scientific Computing
Lax-Friedrichs fast sweeping methods for steady state problems for hyperbolic conservation laws

Journal of Computational Physics
Optimal Trajectories of Curvature Constrained Motion in the Hamilton---Jacobi Formulation

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

Journal of Computational Physics
VIALS: An Eulerian tool based on total variation and the level set method for studying dynamical systems

Journal of Computational Physics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in our sweeping scheme can either be solved analytically or numerically. We illustrate the efficiency and accuracy approach with several numerical examples in two and three dimensions.