Skip to main content

Part of the book series: Lecture Notes in Computational Science and Engineering ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. M. Herrmann, A domain decomposition parallelization of the fast marching method. Technical Report, Center for Turbulence Research, 2003

    Google 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, 2011

    Google Scholar 

  4. J.A. Sethian, A fast marching method for monotonically advancing fronts. Proc. Natl. Acad. Sci. U.S.A. 93(4), 1591–1595 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. J.A. Sethian, Level Set Methods and Fast Marching Methods (Cambridge University Press, Cambridge, 1999). ISBN 9780521645577

    MATH  Google Scholar 

  6. M.C. Tugurlan, Fast marching methods - Parallel implementation and analysis. Dissetation, Louisiana State University, 2008

    Google 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 

Download references

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

Authors

Corresponding author

Correspondence to Petr Kotas .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics