Adaptive generation of hexahedral element mesh using an improved grid-based method

Abstract An improved grid-based algorithm for the adaptive generation of hexahedral finite element mesh is presented in this paper. It is named as the inside-out grid-based method and involves the following four steps. The first step is the generation of an initial grid structure which envelopes the analyzed solid model completely. And the elements size and density maps are constructed based on the surface curvature and local thickness of the solid model. Secondly, the core mesh is generated through removing all the undesired elements using even and odd parity rules. The third step is to magnify the core mesh in an inside-out manner through a surface node projection process using the closest position approach. To match the mesh to the characteristic boundary of the solid model, a minimal Scaled Jacobian criterion is employed. Finally, in order to handle the degenerated elements and improve the quality of the resulting mesh, two comprehensive techniques are employed: the insertion technique and collapsing technique . The present method was applied in the mesh construction of different engineering problems. Scaled Jacobian and Skew metrics are used to evaluate the hexahedral element mesh quality. The application results show that all-hexahedral element meshes which are well-shaped and capture all the geometric features of the original solid models can be generated using the inside-out grid-based method presented in this paper.

[1]  Scott A. Mitchell,et al.  High Fidelity Interval Assignment , 2000, Int. J. Comput. Geom. Appl..

[2]  Steven E. Benzley,et al.  Sculpting: An Improved Inside-Out Scheme for All-Hexahedral Meshing , 2002, IMR.

[3]  Patrick M. Knupp A method for hexahedral mesh shape optimization , 2003 .

[4]  François Guibault,et al.  Three-dimensional anisotropic geometric metrics based on local domain curvature and thickness , 2005, Comput. Aided Des..

[5]  Rolf Bünten,et al.  Automatic generation of hexahedral finite element meshes , 1995, Comput. Aided Geom. Des..

[6]  Ted D. Blacker,et al.  Hexahedral Mesh Generation Using Multi-Axis Cooper Algorithm , 2000, IMR.

[7]  Steven E. Benzley,et al.  The Graft Tool: An All-Hexahedral Transition Algorithm for Creating a Multi-Directional Swept Volume Mesh , 1999, IMR.

[8]  F. Weiler,et al.  Octree-based Generation of Hexahedral Element Meshes , 2007 .

[9]  Timothy J. Tautges,et al.  The Geode Algorithm: Combining Hex/Tet Plastering, Dicing and Transition Elements for Automatic, All-Hex Mesh Generation , 1998, IMR.

[10]  Ted D. Blacker,et al.  Automated Conformal Hexahedral Meshing Constraints, Challenges and Opportunities , 2001, Engineering with Computers.

[11]  Yi Su,et al.  Automatic hexahedral mesh generation for multi-domain composite models using a hybrid projective grid-based method , 2004, Comput. Aided Des..

[12]  Timothy J. Tautges,et al.  THE WHISKER WEAVING ALGORITHM: A CONNECTIVITY‐BASED METHOD FOR CONSTRUCTING ALL‐HEXAHEDRAL FINITE ELEMENT MESHES , 1996 .

[13]  Dong-Yol Yang,et al.  Development of a grid‐based mesh generation technique and its application to remeshing during the finite element simulation of a metal forming process , 1999 .

[14]  Yong-Taek Im,et al.  Remeshing for metal forming simulations—Part II: Three‐dimensional hexahedral mesh generation , 2002 .

[15]  Patrick M. Knupp Next-Generation Sweep Tool: A Method for Generating All-Hex Meshes on Two-and-One-Half Dimensional Geometries , 1998, IMR.

[16]  T. Blacker,et al.  Seams and wedges in plastering: A 3-D hexahedral mesh generation algorithm , 1993, Engineering with Computers.

[17]  Steven E. Benzley,et al.  A Multiple Source and Target Sweeping Method for Generating All Hexahedral Finite Element Meshes , 2007 .