TETRAHEDRAL MESH GENERATION IN CONVEX PRIMITIVES BY MAXIMIZING SOLID ANGLES

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