Premium
Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation
Author(s) -
Joe Barry
Publication year - 1991
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620310511
Subject(s) - delaunay triangulation , tetrahedron , constrained delaunay triangulation , polygon mesh , triangulation , pitteway triangulation , bowyer–watson algorithm , finite element method , geometry , mesh generation , mathematics , volume mesh , combinatorics , surface triangulation , physics , thermodynamics
Abstract The Delaunay triangulation has been used in several methods for generating finite element tetrahedral meshes in three‐dimensional polyhedral regions. Other types of three‐dimensional triangulations are possible, such as a triangulation satisfying a local max‐min solid angle criterion. In this paper, we present experimental results to show that max‐min solid angle triangulations are better than Delaunay triangulations for finite element tetrahedral meshes, since the former type of triangulations contains tetrahedra of better shape than the latter type. We also describe how mesh points are generated and triangulated in our tetrahedral mesh generation method.