Abstract
Level set functions are employed to track interfaces in various application areas including simulation of two-phase flows and image segmentation. Often, a re-initializing algorithm is incorporated to transform a numerically instable level set function to a signed distance function. In this note, we present a parallel algorithm for re-initializing level set functions on unstructured, three-dimensional tetrahedral grids. The main idea behind this new domain decomposition approach is to combine a parallel brute-force re-initializing algorithm with an efficient way to compute distances between the interface and grid points. Time complexity and error analysis of the algorithm are investigated. Detailed numerical experiments demonstrate the accuracy and scalability on up to 128 processes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
