Geometry and Topology for Mesh Generation

The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for example, finite element analysis (FEA). Such applications impose specific constraints upon the resulting surface and volume meshes in terms of their topology and metric characteristics, exactness of the geometry approximation, and conformity with initial attributes. The function representation of the initial object is converted into the resulting cellular representation described by a simplicial complex. We consider in detail all phases of the discretization algorithm from initial surface polygonization to final tetrahedral mesh generation and its adaptation to special FEA needs. The initial object attributes are used at all steps both for controlling geometry and topology of the resulting object and for calculating new attributes for the resulting cellular representation.

Download Full-text

Surface Matching Technique in Hexahedral Element Mesh Generation with Inside-Out Grid-Based Method

Key Engineering Materials ◽

10.4028/www.scientific.net/kem.474-476.908 ◽

2011 ◽

Vol 474-476 ◽

pp. 908-914

Author(s):

Lu Sun ◽

Guo Qun Zhao

Keyword(s):

Mesh Generation ◽

Automatic Generation ◽

Surface Matching ◽

Combined Method ◽

Element Mesh ◽

And Topology ◽

Matching Technique ◽

Hexahedral Element ◽

Matching Rules ◽

Inside Out

Surface matching technique is a key technique in automatic generation of 3D finite element mesh. In this paper, a surface matching technique including surface-gap filling, boundary match and C-node match, is introduced. Eight types of free facet configurations and their corresponding matching rules are established. Then a combined method of priority nodes and relative position relationships for boundary match is presented, and an effective method for C-node match is given, too. The methods can achieve precise match between mesh boundaries and model boundaries, and establish reasonable geometry and topology connections of matched nodes. Several examples are provided to demonstrate the accuracy and efficiency of the algorithms presented in this paper.

Download Full-text