Hexagon-Based All-Quadrilateral Mesh Generation with Guaranteed Angle Bounds

Summary

In this paper, we present a novel hexagon-based mesh generation method which creates all-quadrilateral (all-quad) meshes with guaranteed angle bounds and feature preservation for arbitrary planar domains. Given any planar curves, an adaptive hexagon-tree structure is constructed by using the curvature of the boundaries and narrow regions. Then a buffer zone and a hexagonal core mesh are created by removing elements outside or around the boundary. To guarantee the mesh quality, boundary edges of the core mesh are adjusted to improve their formed angles facing the boundary, and two layers of quad elements are inserted in the buffer zone. For any curve with sharp features, a corresponding smooth curve is firstly constructed and meshed, and then another layer of elements is inserted to match the smooth curve with the original one. It is proved that for any planar smooth curve all the element angles are within [60°-ε, 120°+ε] (ε ≤ 5°). We also prove that the scaled Jacobians defined by two edge vectors are in the range of [sin(60°-ε), sin90°], or [0.82, 1.0]. Furthermore, the same angle range can be guaranteed for curves with sharp features, with the exception of small angles in the input curve. In addition, all the elements in the final mesh are grouped into five types, and most elements only need a few flops to construct the stiffness matrix for finite element analysis. This will significantly reduce the computational time and the required memory during the stiffness matrix construction. We have applied our algorithm to a set of complicated geometries, including the Lake Superior map, and a three-component air foil with sharp features.