Progress in Engineering Computational Technology
Chapter 2 M. Müller-Hannemann
Algorithmics Group, Department of Computer Science, Darmstadt University of Technology, Germany Keywords: hexahedral mesh generation, unstructured mesh generation, algorithmic approaches, mesh quality, mesh optimization, smoothing, quadrilateral surface meshes, mesh topology, hybrid meshes, applications in biomechanics.
In a wide range of applications of numerical simulations by means of the finite element method (FEM) the generation of hexahedral meshes is highly desirable. However, in spite of enormous research efforts, the robust generation of such meshes with an acceptable quality is still a challenge for complex domains. The purpose of this paper is to give a short overview of the state-of-the-art in hexahedral mesh generation. We review the most influential approaches which have been developed over the last years and discuss their strengths and limitations. We focus on scientific developments and do not review commercial products. Owen [1] and Schneiders [2] gave surveys on unstructured mesh generation technology and quadrilateral and hexahedral element meshes, respectively, and Tautges [3] recently presented a survey on the generation of hexahedral meshes with emphasis to assembly geometries. For much more material, online information, and data bases on meshing literature see [4] and [5]. In this paper, we reserve the term mesh generation to unstructured mesh generation, whereas grid generation refers to the generation of structured meshes (which require the same node degree for all interior mesh vertices). We also distinguish between combinatorial and geometric meshes and polyhedral subdivisions. A combinatorial hexahedral mesh is merely a decomposition of the given domain into an abstract (cell) complex of combinatorial cubes but without an explicit embedding into space. Combinatorial meshes are important for the study of mesh existence but they are sometimes also used as a first step in the mesh generation process. In contrast, a geometric hexahedral mesh is an embedded cell complex of hexahedra. Here, each hexahedron is bounded by possibly warped quadrilaterals. Finally, a polyhedral subdivision requires a partition of the given domain into polytopes, i.e., cubes with flat facets. These meshes are the main focus of work in computational geometry, but not used much in practice as very difficult or even impossible to generate. We first discuss the minimal requirements for valid meshes and mesh quality issues. Then we state several criteria for the comparison of meshing algorithms. This serves as a basis for the main section, where we review and compare the different approaches for hexahedral mesh generation which have been developed over the last decade(s) in view of these criteria. We categorize the different approaches into five groups:
We briefly touch upon examples for applications of hexahedral mesh generation. In particular, we review a case study in the field of biomechanics where parts of human bones have been meshed by hexahedra and successfully applied to a FEM analysis. Finally, we conclude with some remarks on remaining challenges and perspectives for future research and development.
References
| ||||||||||
