Feature Decomposition for Hexahedral Meshing

Author(s):  
Yong Lu ◽  
Rajit Gadh ◽  
Timothy J. Tautges

Abstract This paper presents a feature based volume decomposition approach for Hexahedral Mesh generation. In this approach, feature recognition techniques are introduced to determine decomposition features from a CAD model and the model is decomposed into sub-models, which become meshable or can be meshed by meshing algorithms in a computationally inexpensive manner. The feature recognition methods employed are convexity based and use topology and geometry information, which is generally available in BREP solid modelers. The procedure of feature decomposition is recursive: sub-models are further decomposed until either they are matched with appropriate meshing algorithms or no more decomposition features are detected. The code is designed and programmed for self-adaptation and error-tolerance to achieve high automation with complex geometry. The paper gives testing results for several complicated manufactured parts.

2007 ◽  
Vol 43 (4) ◽  
pp. 1505-1508 ◽  
Author(s):  
Hirotomo Fujimori ◽  
So Noguchi ◽  
Hajime Igarashi ◽  
Hideo Yamashita

1999 ◽  
Vol 15 (3) ◽  
pp. 248-262 ◽  
Author(s):  
A. Sheffer ◽  
M. Etzion ◽  
A. Rappoport ◽  
M. Bercovier

2000 ◽  
Vol 10 (04) ◽  
pp. 383-398 ◽  
Author(s):  
ROBERT SCHNEIDERS

An octree-based algorithm for the generation of hexahedral element meshes is presented. The algorithm works in three steps: (i) The geometry to be meshed is approximated by an octree structure. (ii) An unstructured hexahedral element mesh is derived from the octree. (iii) The mesh is adapted to the boundary of the geometry. We focus on step (ii) and describe an algorithm that constructs a hex mesh for a given octree structure.


Sign in / Sign up

Export Citation Format

Share Document