Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm

Jonathan C. Hardwick
1997 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97  
This paper describes the derivation of an empirically ecient parallel two-dimensional Delaunay triangulation program from a theoretically e cient CREW PRAM algorithm. Compared to previous work, the resulting implementation is not limited to datasets with a uniform distribution of points, achieves signi cantly better speedups over good serial code, and is widely portable due to its use of MPI as a communication mechanism. Results are presented for a loosely-coupled cluster of workstations, a
more » ... ributed-memory multicomputer, and a shared-memory multiprocessor. The Machiavelli toolkit used to transform the nested data parallelism inherent in the divide-and-conquer algorithm into achievable task and data parallelism is also described and compared to previous techniques.
doi:10.1145/258492.258516 dblp:conf/spaa/Hardwick97 fatcat:eucj2ma7vbfc3le2ejv7qy24bq