An adaptive domain-decomposition technique for parallelization of the fast marching method

DOI10.1016/j.amc.2011.05.041zbMath1269.65132OpenAlexW1988902760MaRDI QIDQ658651

Emiliano Cristiani, Oliver Vogel, Pascal Gwosdek, Michael Breuß

Publication date: 13 January 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.05.041

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Hamilton-Jacobi equations (35F21)

Related Items (10)

Cache-efficient parallel eikonal solver for multicore CPUs ⋮ Overhang control based on front propagation in 3D topology optimization for additive manufacturing ⋮ A highly scalable massively parallel fast marching method for the eikonal equation ⋮ Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids ⋮ Parallel redistancing using the Hopf-Lax formula ⋮ A Multiscale Domain Decomposition Algorithm for Boundary Value Problems for Eikonal Equations ⋮ Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations ⋮ Parallel level-set methods on adaptive tree-based grids ⋮ An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance ⋮ A shared memory parallel multi-mesh fast marching method for re-distancing

Cites Work

• A note on two problems in connexion with graphs
• A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
• Static PDEs for time-dependent control problems
• Scale space and variational methods in computer vision. Second international conference, SSVM 2009, Voss, Norway, June 1--5, 2009. Proceedings
• O(\(N\)) implementation of the fast marching algorithm
• An $\cal O(N)$ Level Set Method for Eikonal Equations
• Some Improvements of the Fast Marching Method
• Shape-from-shading: a survey
• A Fast Iterative Method for Eikonal Equations
• Fast Semi-Lagrangian Schemes for the Eikonal Equation and Applications
• Convergence of a Generalized Fast-Marching Method for an Eikonal Equation with a Velocity-Changing Sign
• A Viscosity Solutions Approach to Shape-From-Shading
• Multidimensional binary search trees used for associative searching
• Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
• A fast sweeping method for Eikonal equations
• Efficient algorithms for globally optimal trajectories
• A fast marching level set method for monotonically advancing fronts.
• Fast Marching Methods for Stationary Hamilton–Jacobi Equations with Axis-Aligned Anisotropy
• Variational, Geometric, and Level Set Methods in Computer Vision
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
• Optimal algorithm for shape from shading and path planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An adaptive domain-decomposition technique for parallelization of the fast marching method