Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
Publication:4488640
DOI10.1073/pnas.090060097zbMath0963.65076OpenAlexW1990466879WikidataQ35744503 ScholiaQ35744503MaRDI QIDQ4488640
Alexander Vladimirsky, James A. Sethian
Publication date: 3 July 2001
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.090060097
unstructured meshesnumerical testsHamilton-Jacobi equationsfast marching methodsnonlinear eikonal equation
Numerical optimization and variational techniques (65K10) Discrete approximations in optimal control (49M25) Hamilton-Jacobi theories (49L99)
Related Items (57)
Cites Work
- A note on two problems in connexion with graphs
- Curvature and the evolution of fronts
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- A fast level set method for propagating interfaces
- A Viscosity Solutions Approach to Shape-From-Shading
- An O(N log N) algorithm for shape modeling.
- Efficient algorithms for globally optimal trajectories
- A fast marching level set method for monotonically advancing fronts.
This page was built for publication: Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes