Fast Cartesian Mesh Generation for Building-Cube Method using Multi-Core PC

In this study, an efficient and robust Cartesian mesh generation method for BuildingCube 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 can be managed in each cube individually, and is parallelized by OpenMP in this study. Efficiency of the parallelized BCM mesh generation is demonstrated for several 3D test cases using a multi-core PC.