A continuum method for modeling surface tension
Journal of Computational Physics
Computing minimal surfaces via level set curvature flow
Journal of Computational Physics
A level set approach for computing solutions to incompressible two-phase flow
Journal of Computational Physics
A level set formulation of Eulerian interface capturing methods for incompressible fluid flows
Journal of Computational Physics
A parallel algorithm for multilevel graph partitioning and sparse matrix ordering
Journal of Parallel and Distributed Computing
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
SIAM Journal on Numerical Analysis
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array
IEEE Transactions on Parallel and Distributed Systems
Transport and diffusion of material quantities on propagating interfaces via level set methods
Journal of Computational Physics
Parallel Multilevel Tetrahedral Grid Refinement
SIAM Journal on Scientific Computing
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Jump flooding in GPU with applications to Voronoi diagram and distance transform
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Interactive 3D distance field computation using linear factorization
I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
3D Distance Fields: A Survey of Techniques and Applications
IEEE Transactions on Visualization and Computer Graphics
A finite element based level set method for two-phase incompressible flows
Computing and Visualization in Science
Variants of Jump Flooding Algorithm for Computing Discrete Voronoi Diagrams
ISVD '07 Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Fast Sweeping Methods for Eikonal Equations on Triangular Meshes
SIAM Journal on Numerical Analysis
SIAM Journal on Numerical Analysis
A Fast Iterative Method for Eikonal Equations
SIAM Journal on Scientific Computing
Incremental Identification of Transport Coefficients in Convection-Diffusion Systems
SIAM Journal on Scientific Computing
Validity of the single processor approach to achieving large scale computing capabilities
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
A parallel Eulerian interface tracking/Lagrangian point particle multi-scale coupling procedure
Journal of Computational Physics
Another Look at Velocity Extensions in the Level Set Method
SIAM Journal on Scientific Computing
Parallel Banding Algorithm to compute exact distance transform with the GPU
Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Discrete and continuous adjoint approaches to estimate boundary heat fluxes in falling films
Optimization Methods & Software
A parallel strategy for a level set simulation of droplets moving in a liquid medium
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 31.45 |
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.