All-hexahedral element meshing: Generation of the dual mesh by recurrent subdivision (Q1573140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1486974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All-hexahedral element meshing: Generation of the dual mesh by recurrent subdivision |
scientific article; zbMATH DE number 1486974 |
Statements
All-hexahedral element meshing: Generation of the dual mesh by recurrent subdivision (English)
0 references
3 July 2001
0 references
This paper deals with a method that, given a few topological constraints, produces a non-structured all-hexahedral mesh. It is also explained by means of a simple 2D example and then extended into 3D. The concept of duality throughout this paper is an \(N\)-dimensional extension of the graph theoretical duality between a graph and a map: to each \(n\)-dimensional element of the mesh, there is a corresponding (\(N\)-\(n\))-dimensional one of the dual and vice versa. Also many remarkable advances in the topic of all-hexahedral meshing are presented.
0 references
all-hexahedral element meshing
0 references
dual mesh
0 references
recurrent subdivision
0 references
graph theoretical duality
0 references
0 references
0.8481598496437073
0 references
0.8075681328773499
0 references
0.8006482124328613
0 references
0.7852712273597717
0 references
0.7825167775154114
0 references
