Shared-memory block-based fast marching method for hierarchical meshes
DOI10.1016/J.CAM.2021.113488zbMath1468.65177OpenAlexW3132680633MaRDI QIDQ2020521
Andreas Hössinger, Michael Quell, Josef Weinbub, Georgios Diamantopoulos
Publication date: 23 April 2021
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2021.113488
level-set methodeikonal equationfast marching methodshared-memory parallelizationhierarchical meshesre-distancing
Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Partial differential equations of mathematical physics and other areas of application (35Q99)
Related Items (2)
Cites Work
- A note on two problems in connexion with graphs
- A highly scalable massively parallel fast marching method for the eikonal equation
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Revisiting the redistancing problem using the Hopf-Lax formula
- A review of level-set methods and some recent applications
- A shared memory parallel multi-mesh fast marching method for re-distancing
- Some Improvements for the Fast Sweeping Method
- A Fast Iterative Method for Eikonal Equations
- Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
- A fast marching level set method for monotonically advancing fronts.
- An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance
This page was built for publication: Shared-memory block-based fast marching method for hierarchical meshes