An O(N) level set method for eikonal equations
From MaRDI portal
An \(\mathcal O(N)\) level set method for eikonal equations
Recommendations
- Efficient algorithms for propagating interfaces: Fast marching methods and level set methods
- A characteristics driven fast marching method for the eikonal equation
- Fast Marching Methods
- The eikonal equation: numerical efficiency vs. algorithmic complexity on quadrilateral grids
- Some improvements of the fast marching method
Cited in
(13)- A generalized front marching algorithm for the solution of the eikonal equation.
- Ordered line integral methods for solving the eikonal equation
- A level set-based Eulerian approach for anisotropic wave propagation
- High-frequency asymptotics for the numerical solution of the Helmholtz equation
- A fast-marching algorithm for nonmonotonically evolving fronts
- Jacobi’s last geometric statement extends to a wider class of Liouville surfaces
- A fast sweeping method for Eikonal equations
- 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
- A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
- An adaptive domain-decomposition technique for parallelization of the fast marching method
- A high-order fully Lagrangian particle level-set method for dynamic surfaces
- A study of numerical methods for the level set approach
This page was built for publication: An \(\mathcal O(N)\) level set method for eikonal equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719260)