We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

A parabolic level set reinitialisation method using a discontinuous Galerkin discretisation.

Adams, T. and McLeish, N. and Giani, S. and Coombs, W.M. (2019) 'A parabolic level set reinitialisation method using a discontinuous Galerkin discretisation.', Computers and mathematics with applications., 78 (9). pp. 2944-2960.


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 norm decreases proportionally to and the error in the DG norm decreases proportionally to .

Item Type:Article
Full text:Publisher-imposed embargo
(AM) Accepted Manuscript
File format - PDF
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
Publisher Web site:
Publisher statement:© 2019 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license ( licenses/by/4.0/).
Date accepted:29 January 2019
Date deposited:30 January 2019
Date of first online publication:07 March 2019
Date first made open access:10 October 2019

Save or Share this output

Look up in GoogleScholar