Premium
Tetrahedral mesh generation in convex primitives
Author(s) -
Kettunen Lauri,
Forsman Kimmo
Publication year - 1995
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.1620380107
Subject(s) - tetrahedron , polyhedron , polygon mesh , regular polygon , discretization , mathematics , set (abstract data type) , convex polytope , hexahedron , finite element method , geometry , computer science , combinatorics , topology (electrical circuits) , algorithm , convex set , convex optimization , mathematical analysis , engineering , structural engineering , programming language
This paper presents a method for generating tetrahedral meshes in three‐dimensional primitives. Given a set of closed and convex polyhedra having non‐zero volume and some mesh controlling parameters, the polyhedra are automatically split to tetrahedra 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 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, which are not needed to describe the geometry, are generated automatically.