Impact of tetrahedralization on parallel conforming octree mesh generation

摘要

This work discusses the performance impact from the tetrahedralization of non-conforming meshes generated by a parallel octree method capable of handling arbitrary immersed geometries. First, we review conforming techniques for meshes created from octrees. Then we implement a tetrahedralization scheme based on templates in a parallel meshing algorithm that uses a linear octree with 2:1 balancing constraint. Besides, we also propose a change on the partitioning strategy for the same meshing algorithm to improve the octree refinement load balancing. Scalability analyses show that the chosen tetrahedralization technique preserves algorithm performance.