TETRAHEDRAL MESH GENERATION IN CONVEX PRIMITIVES

This paper presents a method for generating tetrahedral meshes in thre e-dimensional primitives. Given a set of closed and convex polyhedra h aving non-zero volume and some mesh controlling parameters, the polyhe dra are automatically split to tetrahedra satisfying the criteria of s tandard finite element meshes. The algorithm tries to generate element s close to regular tetrahedra by maximizing locally the minimum solid angles associated to a set of a few neighbouring 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, wh ich are not needed to describe the geometry, are generated automatical ly.