1996
DOI: 10.1007/bf01198732
|View full text |Cite
|
Sign up to set email alerts
|

A grid-based algorithm for the generation of hexahedral element meshes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
121
0
5

Year Published

2000
2000
2016
2016

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 213 publications
(126 citation statements)
references
References 6 publications
0
121
0
5
Order By: Relevance
“…end for 17: end function to loop on the feature vertices (Lines 3-15) and, for each feature vertex, compute its adjacent global feature edges (5)(6)(7)(8)(9)(10)(11)(12)(13)(14). Once all the feature vertices are traversed, the global feature edges are generated.…”
Section: Algorithm 4 Compute Global Feature Edgesmentioning
confidence: 99%
See 3 more Smart Citations
“…end for 17: end function to loop on the feature vertices (Lines 3-15) and, for each feature vertex, compute its adjacent global feature edges (5)(6)(7)(8)(9)(10)(11)(12)(13)(14). Once all the feature vertices are traversed, the global feature edges are generated.…”
Section: Algorithm 4 Compute Global Feature Edgesmentioning
confidence: 99%
“…To this end, we generate a boundary layer by using the blending function (8). The final mesh, presented in Figure 24, contains 28 levels.…”
Section: Examplesmentioning
confidence: 99%
See 2 more Smart Citations
“…There are four distinct methods for unstructured all-hex mesh generation: grid-based, medial surface, plastering and whisker weaving. The grid-based approach generates a fitted 3D grid of hex elements on the interior of the volume [48] [49]. Medial surface methods involve an initial decomposition of the volume [46] [47].…”
Section: Hexahedral Mesh Generationmentioning
confidence: 99%