Automatic Scheme Selection for Toolkit Hex Meshing

Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50% of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is more robust than feature recognition-based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all-hexahedral meshes by filtering out non-sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume-based interval assignment.

[1]  Scott A. Mitchell,et al.  Reliable Whisker Weaving via Curve Contraction , 1999, Engineering with Computers.

[2]  Matthias Müller-Hannemann,et al.  Hexahedral Mesh Generation by Successive Dual Cycle Elimination , 1999, Engineering with Computers.

[3]  Timothy J. Tautges,et al.  Feature based hex meshing methodology: feature recognition and volume decomposition , 2001, Comput. Aided Des..

[4]  David R. White,et al.  Automated Hexahedral Mesh Generation by Generalized Multiple Source to Multiple Target Sweeping , 2000 .

[5]  David R. White,et al.  Automated Hexahedral Mesh Generation by Virtual Decomposition , 1995 .

[6]  T. Blacker.  The Cooper Tool , 1996 .

[7]  A. P. Gilkey,et al.  GEN3D: A GENESIS database 2D to 3D transformation program , 1989 .

[8]  Michael J. Wozny,et al.  An overview of automatic feature recognition techniques for computer-aided process planning , 1995 .

[9]  Patrick M. Knupp,et al.  Applications of mesh smoothing: copy, morph, and sweep on unstructured quadrilateral meshes , 1999 .

[10]  Steven E. Benzley,et al.  Interval Assignment for Volumes with Holes , 1999 .

[11]  Steven E. Benzley,et al.  GENERALIZED 3-D PAVING : AN AUTOMATED QUADRILATERAL SURFACE MESH GENERATION ALGORITHM , 1996 .

[12]  Matthew L. Staten,et al.  BMSweep: Locating Interior Nodes During Sweeping , 1999, Engineering with Computers.

[13]  M B Stephenson,et al.  Using conjoint meshing primitives to generate quadrilateral and hexahedral elements in irregular regions , 1989 .

[14]  Scott A. Mitchell,et al.  A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume , 1996, STACS.

[15]  T. L. Edwards,et al.  CUBIT mesh generation environment. Volume 1: Users manual , 1994 .