Premium
Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
Author(s) -
Weatherill N. P.,
Hassan O.
Publication year - 1994
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.1620371203
Subject(s) - delaunay triangulation , bowyer–watson algorithm , constrained delaunay triangulation , pitteway triangulation , mesh generation , chew's second algorithm , tetrahedron , grid , boundary (topology) , point (geometry) , triangulation , computer science , ruppert's algorithm , algorithm , surface triangulation , polygon mesh , mathematical optimization , domain (mathematical analysis) , computational science , mathematics , geometry , computer graphics (images) , finite element method , mathematical analysis , engineering , structural engineering
A method is described which constructs three‐dimensional unstructured tetrahedral meshes using the Delaunay triangulation criterion. Several automatic point creation techniques will be highlighted and an algorithm will be presented which can ensure that, given an initial surface triangulation which bounds a domain, a valid boundary conforming assembly of tetrahedra will be produced. Statistics of measures of grid quality are presented for several grids. The efficiency of the proposed procedure reduces the computer time for the generation of realistic unstructured tetrahedral grids to the order of minutes on workstations of modest computational capabilities.