论文信息 - A Massive Parallel Fast Marching Method

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) [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.

Rolf Krause | Vít Vondrák | Petr Kotas | Roberto Croce | Valentina Poletti

[1] W. Jeong. UUCS-07-010 A Fast Iterative Method for a Class of Hamilton-Jacobi Equations on Parallel Systems , 2007 .

[2] Alexander M. Bronstein,et al. Parallel algorithms for approximation of distance maps on parametric surfaces , 2008, TOGS.

[3] Maria Cristina Tugurlan,et al. Fast Marching Methods - parallel implementation and analysis , 2008 .

[4] James A. Sethian,et al. Level Set Methods and Fast Marching Methods , 1999 .

[5] J A Sethian,et al. A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[6] Bobby Bodenheimer,et al. Synthesis and evaluation of linear motion transitions , 2008, TOGS.

[7] M. Herrmann. A Domain Decomposition Parallelization of the Fast Marching Method , 2003 .