This is the authors' abstract. We don't add key points for this paper.
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.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Weatherill et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: