Computational & Technology Resources
an online resource for computational,
engineering & technology publications
PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY
Edited by: B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru and M.L. Romero
Automatic Generation of Hexahedral Meshes for Volumes with Non-Planar Surfaces using the Multi-Sweeping Method
E. Ruiz-Gironés, X. Roca and J. Sarrate
LaCàN, Department of Applied Mathematics III, Universitat Politècnica de Catalunya, Barcelona, Spain
E. Ruiz-Gironés, X. Roca, J. Sarrate, "Automatic Generation of Hexahedral Meshes for Volumes with Non-Planar Surfaces using the Multi-Sweeping Method", in B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru, M.L. Romero, (Editors), "Proceedings of the Seventh International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 58, 2010. doi:10.4203/ccp.94.58
Keywords: mesh generation, hexahedral mesh, multi-sweeping, computational domain, geometry decomposition.
The generation of unstructured hexahedral meshes is still an open problem. Several methods have appeared in the literature to generate such meshes. However, an unstructured hexahedral mesher that can discretize any arbitrary geometry does not exist. Therefore, specific algorithms have been developed for specific types of geometries that often appear in industrial applications. For instance, sweep algorithms [1,2,3,4] have been successfully applied for extrusion geometries defined by a single source surface and a single target surface (one-to-one sweeping algorithms). This method evolved into the many-to-one algorithm  that allows meshing extrusion volumes with several source surfaces but a single target surface. The method decomposes the initial geometry into one-to-one barrels that can be meshed using a one-to-one sweeping scheme. In the last years, several algorithms have appeared to mesh many-to-many extrusion volumes (multi-sweeping algorithms) [6,7]. This algorithm decomposes the volume into many-to-one sub-volumes. Then, each sub-volume is further decomposed into one-to-one barrels. The decomposition is performed by means of projecting nodes along the sweep direction and imprinting surfaces.
However, the quality of the final mesh is directly related to the robustness of the imprinting process and to the location of inner nodes created during the decomposition process, especially for geometries with curved surfaces. To overcome these drawbacks, we propose two original contributions. On the one hand, we introduce the new concept of the computational domain for sweep geometries. The computational domain is a planar representation of the sweep levels and it permits improvement of several geometric calculations performed during the imprinting process. This results in a more robust imprinting process.
On the other hand, we propose to improve the location of inner nodes by performing a three-stage decomposition process. In the first stage, we project the nodes on target surfaces to source surfaces. At this stage, the decomposition of the geometry is determined, but it is desirable to improve the location of inner nodes. To this end, in the second stage, we project back the nodes from source surfaces to target surfaces. In the third stage, the final location of inner nodes is computed as a weighted average of the nodes projected from target surfaces and the nodes projected from source surfaces.
purchase the full-text of this paper (price £20)