Automatic scheme selection for toolkit hex meshing

White, David R.; Tautges, Timothy J.

doi:10.1002/1097-0207(20000910/20)49:1/2<127::aid-nme926>3.0.co;2-v

Cited by 56 publications

(23 citation statements)

References 13 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first step of the algorithm is the classification of the surfaces as source, target and linking sides. The classification is accomplished using the procedure presented in [11]. This procedure is performed as follows.…”

Section: The Multi-sweeping Methodsmentioning

confidence: 99%

A New Procedure to Compute Imprints in Multi-sweeping Algorithms

Ruiz‐Gironés

Roca

Sarrate

2009

Proceedings of the 18th International Meshing Roundtable

View full text Add to dashboard Cite

Abstract.One of the most widely used algorithms to generate hexahedral meshes in extrusion volumes with several source and target surfaces is the multi-sweeping method. However, the multi-sweeping method is highly dependent on the final location of the nodes created during the decomposition process. Moreover, inaccurate location of inner nodes may generate erroneous imprints of the geometry surfaces such that a final mesh could not be generated. In this work, we present a new procedure to decompose the geometry in many-to-one sweepable volumes. The decomposition is based on a least-squares approximation of affine mappings defined between the loops of nodes that bound the sweep levels. In addition, we introduce the concept of computational domain, in which every sweep level is planar. We use this planar representation for two purposes. On the one hand, we use it to perform all the imprints between surfaces. Since the computational domain is planar, the robustness of the imprinting process is increased. On the other hand, the computational domain is also used to compute the projection onto source surfaces. Finally, the location of the inner nodes created during the decomposition process is computed by averaging the locations computed projecting from target and source surfaces.

show abstract

Section: The Multi-sweeping Methodsmentioning

confidence: 99%

A New Procedure to Compute Imprints in Multi-sweeping Algorithms

Ruiz‐Gironés

Roca

Sarrate

2009

Proceedings of the 18th International Meshing Roundtable

View full text Add to dashboard Cite

show abstract

“…A detailed presentation on constraints which must be met for a volume to be sweepable, in a generic sense, are presented in [40]. Based on the definition of an extrusion geometry, the traditional procedure to generate an all-hexahedral mesh by sweeping consists of the following four steps:…”

Section: Sweepingmentioning

confidence: 99%

Unstructured and Semi-Structured Hexahedral Mesh Generation Methods

Ramos¹,

Ruiz‐Gironés²,

Navarro³

2014

Comp. Tech. Rev.

View full text Add to dashboard Cite

Discretization techniques such the finite element method, the finite volume method or the discontinuous Galerkin method are the most used simulation techniques in applied sciences and technology. These methods rely on a spatial discretization adapted to the geometry and to the prescribed distribution of element size. Several fast and robust algorithms have been developed to generate triangular and tetrahedral meshes. In these methods local connectivity modifications are a crucial step. Nevertheless, in hexahedral meshes the connectivity modifications propagate through the mesh. In this sense, hexahedral meshes are more constrained and therefore, more difficult to generate. However, in many applications such as boundary layers in computational fluid dynamics or composite material in structural analysis hexahedral meshes are preferred. In this work we present a survey of developed methods for generating structured and unstructured hexahedral meshes.

show abstract

“…Finally, linking sides are the surfaces that connect source and target surfaces. In order to properly classify the surfaces of the geometry, we have used the technique presented in [13]. The main idea is to find a non-submappable surface (or any arbitrary surface if a non-submappable one does not exist) and classify it as target surface.…”

Section: Surface and Edge Classificationmentioning

confidence: 99%

Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms

Ruiz‐Gironés

Roca

Sarrate

2011

Advances in Engineering Software

View full text Add to dashboard Cite

The multi-sweeping method is one of the most used algorithms to generate hexahedral meshes for extrusion volumes. In this method the geometry is decomposed in sub-volumes by means of projecting nodes along the sweep direction and imprinting faces. Nevertheless, the quality of the final mesh is determined by the location of inner nodes created during the decomposition process and by the robustness of the imprinting process.In this work we present two original contributions to increase the quality of the decomposition process. On the one hand, to improve the robustness of the imprints we introduce the new concept of computational domain for extrusion geometries. Since the computational domain is a planar representation of the sweep levels, we improve several geometric operations involved in the imprinting process. On the other hand, we propose a three-stage procedure to improve the location of the inner nodes created during the decomposition process. First, inner nodes are projected towards source surfaces. Second, the nodes are projected back towards target surfaces. Third, the final position of inner nodes is computed as a weighted average of the projections from source and target surfaces.

show abstract

Automatic scheme selection for toolkit hex meshing

Cited by 56 publications

References 13 publications

A New Procedure to Compute Imprints in Multi-sweeping Algorithms

A New Procedure to Compute Imprints in Multi-sweeping Algorithms

Unstructured and Semi-Structured Hexahedral Mesh Generation Methods

Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms

Contact Info

Product

Resources

About