A massive parallel fast marching method

DOI10.1007/978-3-319-18827-0_30MaRDI QIDQ2815013zbMATH OpenOpenAlexFDO

Authors Petr Kotas, Roberto Croce, V. Poletti, V. Vondrák, Rolf Krause

Publication date 23 June 2016

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18827-0_30

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)

Recommendations

• An adaptive domain-decomposition technique for parallelization of the 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
• Some improvements of the fast marching method
• Fast Marching Methods

Cites work

• A fast marching level set method for monotonically advancing fronts.
• scientific article; zbMATH DE number 1302349 (Why is no real title available?)

Cited in

(8)

• Shared-memory block-based fast marching method for hierarchical meshes
• A shared memory parallel multi-mesh fast marching method for re-distancing
• Some improvements of the fast marching method
• scientific article; zbMATH DE number 870557 (Why is no real title available?)
• An easily implemented, block-based fast marching method with superior sequential and parallel performance
• An adaptive domain-decomposition technique for parallelization of the fast marching method
• A highly scalable massively parallel fast marching method for the eikonal equation
• A stochastic vanishing viscosity approach for eikonal equations

This page was built for publication: A massive parallel fast marching method

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