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 L2 norm decreases proportionally to hp+1 and the error in the DG norm decreases proportionally to hp.
Highlights
The level set method is a popular technique used for representing and tracking evolving interfaces with many applications interesting to engineers and computer scientists
Basting and Kuzmin solved this quasilinear elliptic formulation by first linearising the problem using a Picard iteration and discretising spatially using a continuous Galerkin finite element method. It was the formulation in (7), which led to the work presented in [6], by which an discontinuous Galerkin (DG) spatial discretisation is applied to the elliptic reinitialisation problem
The advantages of this decoupling between adjacent elements are numerous, and include; the methods’ formal high-order accuracy, their high level of parallelisability, their ability to incorporate hp-adaptivity, their ability to deal with complex geometries, as well as their nonlinear stability and ability to deal with discontinuous solutions, see [14,15,16]
Summary
The level set method is a popular technique used for representing and tracking evolving interfaces with many applications interesting to engineers and computer scientists. The aim of the work presented in this article is to extend the level set methodology, through the development of a level set reinitialisation method which employs a discontinuous Galerkin (DG) spatial discretisation. This is an extension of earlier work which presented a reinitialisation method based on the DG solution of an elliptic problem [6], by investigating a reformulation of the elliptic problem in that paper as a nonlinear parabolic problem. Giani et al / Computers and Mathematics with Applications 78 (2019) 2944–2960. The remainder of this introduction consists of the following subsections.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have