An Algorithm for the Generation of Hexahedral Element Meshes based on an Octree Technique
Proceedings, 6th International Meshing Roundtable, Sandia National Laboratories, pp.183-194, October 1997
MAGMA Gie"sereitechnologie GmbH, Kackertstr. 11, 52OT2 Aachen, F.R. Germany
Octree-based mesh generation is done in three steps. First an initial octree structure is setup whose resolution is chosen according to the geometry. This is a non-triyial task for complex geometries (see for example ).
The second problem to be solved is to derive a finite element mesh from the octree structure (removal of the hanging nodes). Most algorithms generate tetrahedral element meshes in this step. The first attempt to octree-ba-sed hexahedral element mesh generation was presented in ; the approach used a special 1-27-octree structure, and conversion was possible for a limited but practically useful number of cases. This talk will present a general procedure for the generation of hexahedral element meshes from arbitrary octree structures.
In the last step the mesh is fitted to the boundary of the geometry. This is done using a generalization of the technique presented in . Fig. 1 shows the octree-based mesh before and after adaptation to the boundary.
 S.A. Mitchell and S.A. Vavasis (1992): Quality Mesh Generation in Three Dimensions. Proc. 8th ACM Symposium on Computational Geometry 212-221.
 R. Schneiders, R. Schindler and F. Weiler (1996): Octree-based Generation of Hexahedral Element Meshes. Proceedings 5th International Meshing Roundtable, Pittsburgh, USA (1996)
 R. Schneiders (1996): A Grid Based Algorithm for the Generation of Hexahedral Element Meshes. Engineering With Computers 12. pp. 168-177
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article