Efficient and Robust Cartesian Mesh Generation for Building-Cube Method

Abstract

In this study, an efficient and robust Cartesian mesh generation method for Building-Cube Method (BCM) is proposed. It can handle “dirty” geometry data whose surface has cracks, overlaps, and reverse of triangle. BCM mesh generation is implemented by two procedures; cube generation and cell generation in each cube. The cell generation procedure in this study is managed in each cube individually, and parallelized by OpenMP. Efficiency of the parallelized BCM mesh generation is demonstrated for several three-dimensional test cases using a multi-core PC.