The Combination of Hexahedral and tetrahedral Meshing Algorithms
Dewhirst, Donald, Sreedhar Vangavolu and Harley Wattrick
Proceedings, 4th International Meshing Roundtable, Sandia National Laboratories, pp.291-304, October 1995
Algorithms are under development for the generation of hexahedron elements within arbitrary solid three-dimensional bodies. Their robustness will increase with time. As an interim strategy, we are investigating the plastering algorithm for hexahedral elements combined with Delaunay tetrahedrization. Initially hexahedron elements are formed as layers working inwrads from the bounding surfaces. If closure does not succeed, we propose to fill the final void(s) with tetrahedron elements.
Although the 8-noded hexahedron is incompatible with the 10-noded tetrahedron, multi-point constraints can be generated that enable the successful joining of these elements. Details of the joining are described elsewhere, but a benchmark study of the joining methods will be repeated here and extended to warped hexahedron faces. The purpose of the present study is to determine the trade-off in efficiency vs accuracy for filling with 10-noded tetrahedra that use MPC's vs 4-noded tetrahedra without MPC's vs comparable all hexahedron solutions.
Contact author(s) or publisher for availability and copyright information on above referenced article