2000
DOI: 10.1142/s021819590000022x
|View full text |Cite
|
Sign up to set email alerts
|

Octree-Based Hexahedral Mesh Generation

Abstract: An octree-based algorithm for the generation of hexahedral element meshes is presented. The algorithm works in three steps: (i) The geometry to be meshed is approximated by an octree structure. (ii) An unstructured hexahedral element mesh is derived from the octree. (iii) The mesh is adapted to the boundary of the geometry. We focus on step (ii) and describe an algorithm that constructs a hex mesh for a given octree structure.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2004
2004
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 54 publications
(22 citation statements)
references
References 5 publications
0
22
0
Order By: Relevance
“…With such a limitation, the full power of mesh optimization cannot be unlocked [5]. The advent of tools such as paving [6], plastering [7], whisker weaving [8], medial axis and surface [9], embedded Voronoi graph [10] or grid-based methods [11][12][13] for unstructured quadrilateral and hexahedral mesh generation brought the need for a new crop of adaptation methods. Recombination of quadrilaterals from adapted triangles [14,15] and rectangular cell packing [16] are very attractive but extensions in three dimensions are yet to be developed.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…With such a limitation, the full power of mesh optimization cannot be unlocked [5]. The advent of tools such as paving [6], plastering [7], whisker weaving [8], medial axis and surface [9], embedded Voronoi graph [10] or grid-based methods [11][12][13] for unstructured quadrilateral and hexahedral mesh generation brought the need for a new crop of adaptation methods. Recombination of quadrilaterals from adapted triangles [14,15] and rectangular cell packing [16] are very attractive but extensions in three dimensions are yet to be developed.…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, iterative local refinement methods using quadtrees in two dimensions can be extended in three dimensions using octrees but result in non-conformal elements with hanging nodes that cannot be treated by some solvers. Although all-quadrilateral transition templates to remove those hanging nodes are readily available for quadtrees [17], it is only recently that all-hexahedral transition patterns have been developed for octrees [12,13]. The directional refinement method of Schneiders uses an octree to insert conformal buffer layers in alternating x, y, and z directions [12].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…However, although it can improve both vertex density and element shape, smoothing is limited by a fixed mesh topology. Mesh refinement and coarsening, on the other hand, involve connectivity modifications [9,10,11,12]. The major issue with conformal refinement-coarsening is, however, that element shape quality cannot be maintained without a powerful local reconnection method and the coveted cubical flip operator is still only theoretical in three dimensions [13].…”
Section: Cubical Adaptationmentioning
confidence: 99%
“…The plastering method is similar to the advancing front approach with hexahedral elements. 39 The Whisker weaving algorithm 40 first constructs the spatial twist continuum (STC: dual of the hexahedral mesh). 41 The medial surface method 42 decomposes the volume in a set of medial surfaces.…”
Section: Volumetric Meshingmentioning
confidence: 99%