Automatic Scheme Selection for Toolkit Hex Meshing
TL;DR: This paper describes a new algorithm for detecting extruded or sweepable geometries that uses topological and local geometric information, and is more robust than feature recognition-based algorithms.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Hexahedral mesh generation constraints
TL;DR: A survey of constraints associated with hexahedral meshes (i.e., the conditions that must be satisfied to produce ahexahedral mesh) is presented and how incorporation of these constraints into existing hexahed mesh generation algorithms could be utilized to extend the class of geometries to which these algorithms apply is discussed.
The generation of hexahedral meshes for assembly geometry: survey and progress
TL;DR: Progress to date in automating many parts of the hex meshing process, which has halved the time to produce all‐hex meshes for large assemblies, is reviewed.
90
Feature based hex meshing methodology: feature recognition and volume decomposition ☆
TL;DR: In this article, a feature-based meshing methodology is proposed to automatically decompose a CAD model into hex meshable volumes, where each meshable portion is recognized as a meshing feature.
83
Topologic and geometric constraint-based hexahedral mesh generation
Chris R. Johnson,Jason F. Shepherd +1 more
- 01 Jan 2007
TL;DR: This dissertation focuses on delineating known constraints associated with hexahedral meshes and formulating these constraints utilizing the dual of thehexahedral mesh, and shows that hexahedrahedral mesh generation can be viewed as an optimization problem.
69
Methods for Multisweep Automation
Jason F. Shepherd,Scott A. Mitchell,Patrick M. Knupp,David R. White +3 more
- 14 Sep 2000
TL;DR: Progress on the automatic, robust generation of MultiSwept meshes in CUBIT is described, which extends the class of volumes that may be swept to include those with multiple source and multiple target surfaces.
References
CUBIT mesh generation environment. Volume 1: Users manual
T.D. Blacker,W.J. Bohnhoff,T.L. Edwards +2 more
- 01 May 1994
TL;DR: This manual is designed to serve as a reference and guide to creating finite element models in the CUBIT environment to reduce the time required to create all-quadrilateral and all-hexahedral meshes.
BMsweep: Locating Interior Nodes During Sweeping.
Matthew L. Staten,Scott A. Canann,Steven J. Owen +2 more
- 01 Jan 1998
TL;DR: BMSweep is a new algorithm to determine the location of interior nodes while generating hexahedral meshes using the volume sweeping method, which uses background mesh interpolation to locate interior nodes during sweeping.
112
BMSweep: Locating Interior Nodes During Sweeping
TL;DR: BMSweep as discussed by the authors is a new algorithm to determine the location of interior nodes while generating hexahedral meshes using the volume sweeping method, which is performed on two and one half-dimensional volumes by identifying a "source" surface which is meshed with quadrilaterals.
92
Reliable whisker weaving via curve contraction
TL;DR: Reliability has been achieved by using new, provable curvecontraction algorithms to sequence the advancing front process, and it is demonstrated that sheet moving can remove certain types of invalid connectivity.
92
Reliable Whisker Weaving via Curve Contraction.
Nathan T. Folwell,Scott A. Mitchell +1 more
- 01 Jan 1998
TL;DR: Whisker Weaving as mentioned in this paper is an advancing front algorithm for all-hexahedral mesh generation, which uses global information derived from grouping the mesh dual into surfaces, the STC, to construct the connectivity of the mesh, then positions the nodes afterwards.
86