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

DOI10.1016/J.AMC.2011.05.041zbMATH Open1269.65132OpenAlexW1988902760MaRDI QIDQ658651FDOQ658651

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

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

Recommendations

• A massive parallel fast marching method
• An easily implemented, block-based fast marching method with superior sequential and parallel performance
• A highly scalable massively parallel fast marching method for the eikonal equation
• Variational, Geometric, and Level Set Methods in Computer Vision
• Solving the eikonal equation on an adaptive mesh

Mathematics Subject Classification ID

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

Cites Work

• A note on two problems in connexion with graphs
• Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
• Title not available (Why is that?)
• A fast sweeping method for Eikonal equations
• Efficient algorithms for globally optimal trajectories
• A fast marching level set method for monotonically advancing fronts.
• Scale space and variational methods in computer vision. Second international conference, SSVM 2009, Voss, Norway, June 1--5, 2009. Proceedings
• Shape-from-shading: a survey
• A Fast Iterative Method for Eikonal Equations
• A Viscosity Solutions Approach to Shape-From-Shading
• Title not available (Why is that?)
• Multidimensional binary search trees used for associative searching
• A characteristics driven fast marching method for the eikonal equation
• A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
• Some improvements of the fast marching method
• Convergence of a generalized fast-marching method for an eikonal equation with a velocity-changing sign
• O(\(N\)) implementation of the fast marching algorithm
• Optimal algorithm for shape from shading and path planning
• Fast Semi-Lagrangian Schemes for the Eikonal Equation and Applications
• An \(\mathcal O(N)\) level set method for eikonal equations
• A non-monotone fast marching scheme for Hamilton-Jacobi equation modelling dislocation dynamics
• Variational, Geometric, and Level Set Methods in Computer Vision
• Static PDEs for time-dependent control problems
• Title not available (Why is that?)
• Fast marching methods for stationary Hamilton-Jacobi equations with axis-aligned anisotropy

Cited In (14)

• A dynamic domain decomposition for the eikonal-diffusion equation
• A multiscale domain decomposition algorithm for boundary value problems for eikonal equations
• Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids
• An easily implemented, block-based fast marching method with superior sequential and parallel performance
• Shared-memory block-based fast marching method for hierarchical meshes
• Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations
• Parallel level-set methods on adaptive tree-based grids
• A shared memory parallel multi-mesh fast marching method for re-distancing
• ParaVoxel: A Domain Decomposition Based Fixed Grid Preprocessor
• Overhang control based on front propagation in 3D topology optimization for additive manufacturing
• A massive parallel fast marching method
• Parallel redistancing using the Hopf-Lax formula
• Cache-efficient parallel eikonal solver for multicore CPUs
• A highly scalable massively parallel fast marching method for the eikonal equation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658651)