Advertisement

A Massive Parallel Fast Marching Method

  • Petr KotasEmail author
  • Roberto Croce
  • Valentina Poletti
  • Vit Vondrak
  • Rolf Krause
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 104)

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.

Keywords

Parallel Algorithm Domain Decomposition Eikonal Equation Signed Distance Function High Performance Computer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

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.

References

  1. 1.
    M. Herrmann, A domain decomposition parallelization of the fast marching method. Technical Report, Center for Turbulence Research, 2003Google Scholar
  2. 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. 3.
    L.A.Z. Núnez, Parallel implementation of fast marching method. Technical Report, Massachusetts Institute of Technology, 2011Google Scholar
  4. 4.
    J.A. Sethian, A fast marching method for monotonically advancing fronts. Proc. Natl. Acad. Sci. U.S.A. 93(4), 1591–1595 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    J.A. Sethian, Level Set Methods and Fast Marching Methods (Cambridge University Press, Cambridge, 1999). ISBN 9780521645577zbMATHGoogle Scholar
  6. 6.
    M.C. Tugurlan, Fast marching methods - Parallel implementation and analysis. Dissetation, Louisiana State University, 2008Google Scholar
  7. 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

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Petr Kotas
    • 1
    Email author
  • Roberto Croce
    • 2
  • Valentina Poletti
    • 2
  • Vit Vondrak
    • 1
  • Rolf Krause
    • 2
  1. 1.Department of Applied MathematicsVSB-Technical University of OstravaOstrava-PorubaCzech Republic
  2. 2.Institute of Computational ScienceUniversity of LuganoLuganoSwitzerland

Personalised recommendations