A parabolic level set reinitialisation method using a discontinuous Galerkin discretisation. (1st November 2019)

• Record Type: Journal Article
• Authors: Adams, Thomas; McLeish, Nicholas; Giani, Stefano; Coombs, William M.
• Is Part Of: Computers & mathematics with applications. Volume 78:issue 9(2019)
• Page Start: 2944
• Page End: 2960
• Publication Date: 2019-11-01
• Subjects: Level set -- Reinitialisation -- Discontinuous Galerkin; Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2019.01.032
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: Level set reinitialisation is a part of the level set methodology which allows one to generate, at any point during level set evolution, a level set function which is a signed distance function to its own zero isocontour. Whilst not in general a required condition, maintaining the level set function as a signed distance function is often desirable as it removes a known source of numerical instability. This paper presents a novel level set reinitialisation method based on the solution of a nonlinear parabolic PDE. The PDE is discretised using a symmetric interior penalty discontinuous Galerkin method in space, and an implicit Euler method in time. Also explored are explicit and semi-implicit time discretisations, however, numerical experiments demonstrate that such methods suffer from severe time step restrictions, leading to prohibitively large numbers of iterations required to achieve convergence. The proposed method is shown to be high-order accurate through a number of numerical examples. More specifically, the presented experimental orders of convergence align with the well established optimal convergence rates for the symmetric interior penalty method; that is the error in the L 2 norm decreases proportionally to h p + 1 and the error in the DG norm decreases proportionally to h p .