An $\cal O(N)$ Level Set Method for Eikonal Equations

DOI10.1137/S1064827500367130zbMath0994.76080MaRDI QIDQ2719260

Seongjai Kim

Publication date: 21 June 2001

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

eikonal equationfirst-arrival traveltimefast marching methodnarrow band approachlevel set algorithmcorrection-by-iteration strategygroup marching methodgroup of grid points

Mathematics Subject Classification ID

Related Items (10)

A study of numerical methods for the level set approach ⋮ A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations ⋮ A generalized front marching algorithm for the solution of the eikonal equation. ⋮ An adaptive domain-decomposition technique for parallelization of the fast marching method ⋮ A fast sweeping method for Eikonal equations ⋮ High-frequency asymptotics for the numerical solution of the Helmholtz equation ⋮ Ordered line integral methods for solving the eikonal equation ⋮ An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance ⋮ Riemannian Fast-Marching on Cartesian Grids, Using Voronoi's First Reduction of Quadratic Forms ⋮ Jacobi’s last geometric statement extends to a wider class of Liouville surfaces

This page was built for publication: An $\cal O(N)$ Level Set Method for Eikonal Equations