Parallel redistancing using the Hopf-Lax formula

Michael Royston, Andre Pradhana, Byungjoon Lee, Yat Tin Chow, Wotao Yin, Joseph Teran, Stanley J. Osher

Abstract

Highlights • Using Hopf–Lax formulation, reworks redistancing problem to be trivially parallel. • Uses grid based data to redistance. • Provides easy narrowbanding strategy for redistancing. • Shows feasibility of results using a GPU. 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.
BibTeX
@article{royston2018parallel,
  author = {Michael Royston and Andre Pradhana and Byungjoon Lee and Yat Tin Chow and Wotao Yin and Joseph Teran and Stanley J. Osher},
  title = {{Parallel redistancing using the Hopf-Lax formula}},
  journal = {Journal of Computational Physics},
  year = {2018},
  url = {https://openreview.net/forum?id=lmEVpbFwEMM},
}

Loading related content...

Figure