Much progress has been made through these years to achieve automatic hexahedral mesh generation. While general meshing algorithms that can take on general geometry are not there yet; many well-proven automatic meshing algorithms now work on certain classes of geometry. This paper presents a feature based volume decomposition approach for automatic Hexahedral Mesh generation. In this approach, feature recognition techniques are introduced to determine decomposition features from a CAD model. The features are then decomposed and mapped with appropriate automatic meshing algorithms suitable for the correspondent geometry. Thus a formerly unmeshable CAD model may become meshable. 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 feature recognition methods employed are convexity based and use topology and geometry information, which is generally available in BREP solid models. The operations of volume decomposition are also detailed in the paper. The final section, the capability of the feature decomposer is demonstrated over some complicated manufactured parts.
[1]
M. G. Salvadori,et al.
Numerical methods in engineering
,
1955
.
[2]
Michael J. Wozny,et al.
An overview of automatic feature recognition techniques for computer-aided process planning
,
1995
.
[3]
M. Sabin,et al.
Hexahedral mesh generation by medial surface subdivision: Part I. Solids with convex edges
,
1995
.
[4]
R. Gadh,et al.
Basic LOgical Bulk Shapes (BLOBs) for Finite Element Hexahedral Mesh Generation to Support Virtual Prototyping
,
1998
.
[5]
M. Price,et al.
Hexahedral Mesh Generation by Medial Surface Subdivision: Part II. Solids with Flat and Concave Edges
,
1997
.
[6]
Rajit Gadh,et al.
Shape feature determination usiang the curvature region representation
,
1997,
SMA '97.
[7]
Alla Sheffer,et al.
Hexahedral Mesh Generation using the Embedded Voronoi Graph
,
1999,
Engineering with Computers.