Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Generation and refinement of tetrahedral meshes are considered here. The approach of the authors consists of two steps (i) sequential mesh initialization and (ii) parallel mesh refinement. The significant feature of the authors' algorithm is that the submesh interface are allowed to change as new vertices are inserted concurrently in to the distributed mesh. The authors prove that the parallel refinement algorithm terminates, and generates a new distributed Delauney mesh containing tetrahedra whose circumradius to shortest edge ratio is less than 2.
scientific article; zbMATH DE number 2083154