Abstract
In this paper we present a novel technique based on domain decomposition which enables us to perform the fast marching method (FMM) [4] on massive parallel high performance computers (HPC) for given triangulated geometries. The FMM is a widely used numerical method and one of the fastest serial state-of-the-art techniques for computing the solution to the Eikonal equation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
M. Herrmann, A domain decomposition parallelization of the fast marching method. Technical Report, Center for Turbulence Research, 2003
W. Jeong, R.T. Whitaker, A fast iterative method for a class of hamilton-jacobi equations on parallel systems. Sch. Comput. Univ. Utah 84112(2), 1–4 (2007)
L.A.Z. Núnez, Parallel implementation of fast marching method. Technical Report, Massachusetts Institute of Technology, 2011
J.A. Sethian, A fast marching method for monotonically advancing fronts. Proc. Natl. Acad. Sci. U.S.A. 93(4), 1591–1595 (1996)
J.A. Sethian, Level Set Methods and Fast Marching Methods (Cambridge University Press, Cambridge, 1999). ISBN 9780521645577
M.C. Tugurlan, Fast marching methods - Parallel implementation and analysis. Dissetation, Louisiana State University, 2008
O. Weber, Y.S. Devir, A.M. Bronstein, M.M. Bronstein, R. Kimmel, Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Trans. Graph. 27(4), 104 (2008)
Acknowledgements
This result/work/publication was supported by the European Regional Development Fund in the IT4Innovations Centre of Excellence project (CZ.1.05/1.1.00/02.0070) and the project of major infrastructures for research, development and innovation of Ministry of Education, Youth and Sports with reg. num. LM2011033.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kotas, P., Croce, R., Poletti, V., Vondrak, V., Krause, R. (2016). A Massive Parallel Fast Marching Method. In: Dickopf, T., Gander, M., Halpern, L., Krause, R., Pavarino, L. (eds) Domain Decomposition Methods in Science and Engineering XXII. Lecture Notes in Computational Science and Engineering, vol 104. Springer, Cham. https://doi.org/10.1007/978-3-319-18827-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-18827-0_30
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18826-3
Online ISBN: 978-3-319-18827-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)