Tetrahedral Mesh Generation in Convex Primitives
Kettunen, Lauri and Kimmo Forsman
International Journal For Numerical Methods in Engineering, Wiley, Vol 38, pp.99-117, February 1995
This paper presents a method for generating tetrahedral meshes in three- dimensional primitives. Given a set of convex and closed polhedra having non-zero volume and some mesh controlling parameters, the polyhedra are automatically split to tetrhedra satisfying the criteria of standard finite element meshes. The algorithm tries to generate elements close to regular tetrahedra by maximizing locally the minimum solid angles associated to a set of a few neighboring tetrahedra. The input parameters define the size of the tetrahedra and they can be used to increase or decrease the discretization locally. All the new nodes, which are not needed to describe the geometry, are generated automatically.
Contact author(s) or publisher for availability and copyright information on above referenced article