Parallel redistancing using the Hopf-Lax formula

Abstract We present a parallel method for solving the eikonal equation associated with level set redistancing. Fast marching [1] , [2] and fast sweeping [3] are the most popular redistancing methods due to their efficiency and relative simplicity. However, these methods require propagation of information from the zero-isocontour outwards, and this data dependence complicates efficient implementation on today's multiprocessor hardware. Recently an interesting alternative view has been developed that utilizes the Hopf–Lax formulation of the solution to the eikonal equation [4] , [5] . In this approach, the signed distance at an arbitrary point is obtained without the need of distance information from neighboring points. We extend the work of Lee et al. [4] to redistance functions defined via interpolation over a regular grid. The grid-based definition is essential for practical application in level set methods. We demonstrate the effectiveness of our approach with GPU parallelism on a number of representative examples.

[1]  S. Osher,et al.  A level set approach for computing solutions to incompressible two-phase flow , 1994 .

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

[3]  Ronald Fedkiw,et al.  Level set methods and dynamic implicit surfaces , 2002, Applied mathematical sciences.

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Nahid Emad,et al.  Fast Iterative Method in Solving Eikonal Equations: A Multi-level Parallel Approach , 2014, ICCS.

[6]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[7]  Frederick Stern,et al.  A highly scalable massively parallel fast marching method for the Eikonal equation , 2015, J. Comput. Phys..

[8]  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.

[9]  S. Osher,et al.  Algorithms for overcoming the curse of dimensionality for certain Hamilton–Jacobi equations arising in control theory and elsewhere , 2016, Research in the Mathematical Sciences.

[10]  Ross T. Whitaker.  A FAST EIKONAL EQUATION SOLVER FOR PARALLEL SYSTEMS , 2007 .

[11]  P. Smereka,et al.  A Remark on Computing Distance Functions , 2000 .

[12]  Zhao,et al.  PARALLEL IMPLEMENTATIONS OF THE FAST SWEEPING METHOD , 2007 .

[13]  P. Lions,et al.  Two approximations of solutions of Hamilton-Jacobi equations , 1984 .

[14]  Frédéric Gibou,et al.  Hybrid massively parallel fast sweeping method for static Hamilton-Jacobi equations , 2016, J. Comput. Phys..

[15]  J. Tsitsiklis,et al.  Efficient algorithms for globally optimal trajectories , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[16]  Michael Breuß,et al.  An adaptive domain-decomposition technique for parallelization of the fast marching method , 2011, Appl. Math. Comput..

[17]  J. Sethian,et al.  FRONTS PROPAGATING WITH CURVATURE DEPENDENT SPEED: ALGORITHMS BASED ON HAMILTON-JACOB1 FORMULATIONS , 2003 .

[18]  Hongkai Zhao,et al.  A fast sweeping method for Eikonal equations , 2004, Math. Comput..

[19]  Frédéric Gibou,et al.  A parallel fast sweeping method for the Eikonal equation , 2013, J. Comput. Phys..

[20]  Jérôme Darbon,et al.  Revisiting the redistancing problem using the Hopf-Lax formula , 2017, J. Comput. Phys..

[21]  S. Osher,et al.  Algorithms Based on Hamilton-Jacobi Formulations , 1988 .