Tetrahedral mesh generation in convex primitives by maximizing solid angles

This paper presents a method to generate tetrahedral meshes in three dimensional primitives for finite element computation. Input parameters define the global size of tetrahedra which can be increased or decreased locally. All the new nodes, which are not needed to describe the geometry, are generated automatically. The algorithm first discretizes all arrises of primitives to edges, then all faces of primitives are split to triangles and finally the primitives are filled with tetrahedra. The algorithm tries to generate elements close to regular tetrahedra by maximizing locally the minimum solid angles associated to a set of a few neighbouring tetrahedra