Parallel mesh adaptation using parallel graph partitioning

This paper presents a parallel remeshing algorithm for distributed-memory architectures. It is an iterative parallel algorithm that divides the areas to be remeshed into multiple pieces which can be distributed to as many processing elements as pos-sible, in order for these pieces to be remeshed concurrently by a third-party sequential remesher. Then, remeshed pieces are reintegrated into the distributed mesh, and this pro-cess is iterated until all relevant areas of the mesh have been remeshed. Any sequential remesher can be used, provided it allows some of the mesh elements not to be modified, so as to preserve interfaces between pieces. Our method, which has been implemented in the PaMPA library, is validated by a set of experiments involving both isotropic and anisotropic meshes.