Parallel Constrained Delaunay Meshing

AMD-Vol. 220 Trends in Unstructured Mesh Generation, ASME, pp.89-96, July 1997

MESHING
RESEARCH
CORNER

Dept of Computer Science
Cornell University
Ithaca, NY 14853-3801

presented at
The 1997 Joint ASME/ASCE/SES Summer Meeting
June 29-July 2, 1997
Northwestern University
Evanston Illinois

Abstract
We present a parallel unstructured grid generation method based on the Constrained Delaunay Triangulation (CDT). The Parallel Constrained Meshing Algorithm uses certain edges of the initial mesh as constraints that, without compromising the grid quality, help in the minimization of communication overhead and in the elimination of the synchronization overhead. By combining the CDT and its data-centric task- parallel implementation we produce a meshing algorithm that requires almost no synchronization. Moreover, experiments show that the use of the CDT for meshing cuts communication time by a factor of about seven when compared to a similar meshing algorithm that does not use the CDT.