Premium
Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions
Author(s) -
Joe Barry
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.1620370409
Subject(s) - polyhedron , tetrahedron , convex polytope , regular polygon , mathematics , geometry , boundary (topology) , polygon mesh , combinatorics , convex set , mathematical analysis , convex optimization
A method using techniques of computational geometry for generating tetrahedral finite element meshes in three‐dimensional polyhedral regions is presented. The input to the method consists of the boundary faces of the polyhedral region and possibly internal and hole interfaces, plus the desired number of tetrahedra and other scalar parameters. The region is decomposed into convex polyhedra in two stages so that tetrahedra of one length scale can be generated in each subregion. A mesh distribution function, which is either automatically constructed from the first‐stage convex polyhedron decomposition or supplied by the user, is used to determine the tetrahedron sizes in the subregions. Then a boundary‐constrained triangulation is constructed in each convex polyhedron, with local transformations being used to improve the quality of the tetrahedra. Experimental results from triangulations of three regions are provided.