A boundary recovery algorithm for Delaunay tetrahedral meshing

Dmitri Sharov, Kazuhiro Nakahashi · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1996

A method for automatic generation of unstructured grids comprised 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 by 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.

Read the paper · More papers on PaperTik