Automatic Scheme Selection for Toolkit Hex Meshing

TAUTGES, TIMOTHY J; WHITE, DAVID R

Title: Automatic Scheme Selection for Toolkit Hex Meshing

Full Record
Other Related Research

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.

Authors:: TAUTGES, TIMOTHY J; WHITE, DAVID R

Publication Date:: Mon Sep 27 00:00:00 EDT 1999

Research Org.:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)

Sponsoring Org.:: US Department of Energy (US)

OSTI Identifier:: 14061

Report Number(s):: SAND99-2539C
TRN: AH200136%%294

DOE Contract Number:: AC04-94AL85000

Resource Type:: Conference

Resource Relation:: Conference: 8th International Meshing Roundtable, South Lake Tahoe, CA (US), 10/10/1999--10/13/1999; Other Information: PBD: 27 Sep 1999

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; MESH GENERATION; MAPPING; COMPUTER CALCULATIONS; SUBMAPPING; SWEEPING; HEXAHEDRA; TOOLKIT; CUBIT

Citation Formats


                    TAUTGES, TIMOTHY J, and WHITE, DAVID R. Automatic Scheme Selection for Toolkit Hex Meshing.  United States: N. p., 1999. 
        Web.

Copy to clipboard


                    TAUTGES, TIMOTHY J, & WHITE, DAVID R. Automatic Scheme Selection for Toolkit Hex Meshing.  United States.

Copy to clipboard


                    TAUTGES, TIMOTHY J, and WHITE, DAVID R. 1999.  
        "Automatic Scheme Selection for Toolkit Hex Meshing".  United States.  https://www.osti.gov/servlets/purl/14061.

Copy to clipboard


                    
@article{osti_14061,

  title        = {Automatic Scheme Selection for Toolkit Hex Meshing},

  author       = {TAUTGES, TIMOTHY J and WHITE, DAVID R},

  abstractNote = {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.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/14061},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Mon Sep 27 00:00:00 EDT 1999},

  month        = {Mon Sep 27 00:00:00 EDT 1999}

}

Copy to clipboard

Conference:

View Conference (1.08 MB)

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Automatic scheme selection for toolkit hex meshing

Conference WHITE, DAVID; TAUTGES, TIMOTHY

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 moremore »« less
Full Text Available
Feature based volume decomposition for automatic hexahedral mesh generation

Journal Article LU, YONG; GADH, RAJIT; TAUTGES, TIMOTHY - ASME Journal of Manufacturing Science and Engineering

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 featuremore »« less
Full Text Available
Methods for Multisweep Automation

Conference SHEPHERD, JASON; MITCHELL, SCOTT; KNUPP, PATRICK; ...

Sweeping has become the workhorse algorithm for creating conforming hexahedral meshes of complex models. This paper describes progress on the automatic, robust generation of MultiSwept meshes in CUBIT. MultiSweeping extends the class of volumes that may be swept to include those with multiple source and multiple target surfaces. While not yet perfect, CUBIT's MultiSweeping has recently become more reliable, and been extended to assemblies of volumes. Sweep Forging automates the process of making a volume (multi) sweepable: Sweep Verification takes the given source and target surfaces, and automatically classifies curve and vertex types so that sweep layers are well formedmore » and progress from sources to targets.« less
Full Text Available
CUBIT mesh generation environment. Volume 1: Users manual

Technical Report Blacker, T; Bohnhoff, W; Edwards, T

The CUBIT mesh generation environment is a two- and three-dimensional finite element mesh generation tool which is being developed to pursue the goal of robust and unattended mesh generation--effectively automating the generation of quadrilateral and hexahedral elements. It is a solid-modeler based preprocessor that meshes volume and surface solid models for finite element analysis. A combination of techniques including paving, mapping, sweeping, and various other algorithms being developed are available for discretizing the geometry into a finite element mesh. CUBIT also features boundary layer meshing specifically designed for fluid flow problems. Boundary conditions can be applied to the mesh throughmore »« less
https://doi.org/10.2172/10176386

Full Text Available
Spectral Element Applications in Complex Nuclear Reactor Geometries: Tet-to-Hex Meshing

Journal Article Yuan, Haomin; Merzari, Elia; Yu, Yiqi; ... - Nuclear Engineering and Design

The spectral element code Nek5000 is an open-source, higher-order computational fluid dynamics code developed at Argonne National Laboratory. It is designed to solve incompressible Navier-Stokes equations, but it also has a low-Mach-number approximation feature available. Large eddy simulation is approached by explicit filtering of the velocity field (and other fields) to mimic the effect of dissipation due to the unresolved scale. The computational domain is decomposed into second-order hexahedral elements that conform to the boundaries. However, generating a high-quality pure-hexahedral mesh can be challenging for some problems. For simple geometries, traditional blocking methods can be used to decompose the domainmore »« less
https://doi.org/10.1016/j.nucengdes.2019.110422

Similar Records