A Massive Parallel Fast Marching Method
In this paper we present a novel technique based on domain decomposition which enables us to perform the fast marching method (FMM)  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.
KeywordsParallel Algorithm Domain Decomposition Eikonal Equation Signed Distance Function High Performance Computer
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.
- 1.M. Herrmann, A domain decomposition parallelization of the fast marching method. Technical Report, Center for Turbulence Research, 2003Google Scholar
- 2.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)Google Scholar
- 3.L.A.Z. Núnez, Parallel implementation of fast marching method. Technical Report, Massachusetts Institute of Technology, 2011Google Scholar
- 6.M.C. Tugurlan, Fast marching methods - Parallel implementation and analysis. Dissetation, Louisiana State University, 2008Google Scholar
- 7.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)Google Scholar