A Boundary Recovery Algorithm for Delaunay Tetrahedral Meshing
Sharov, Dmitri and Kazuhiro Nakahashi
5th International Conference on Numerical Grod Generation on Computational Field Simulations, Mississippi State University, pp.229-238, April 1996
A method for automatic generation of unstructured grids comprisied of tetrahedra is discussed. Delaunay approach for tetrahedral grid generation is used. Particular attention is given to the boundary constraining problem. A simple and robust algorithm for the boundary constraining successive use of boundary edge swapping, tetrahedral edge swapping and direct subdivision of tetrahedra is used. Small modifications allow to apply the method for viscous grid generation as well. Grid examples demonstrate efficiency of the method.
Contact author(s) or publisher for availability and copyright information on above referenced article