## Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm (1997)

### Cached

### Download Links

- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www-2.cs.cmu.edu]
- [www.cs.cmu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures |

Citations: | 12 - 2 self |

### BibTeX

@INPROCEEDINGS{Hardwick97implementationand,

author = {Jonathan C. Hardwick},

title = {Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm},

booktitle = {in Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures},

year = {1997},

pages = {23--25}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper describes the derivation of an empirically efficient parallel two-dimensional Delaunay triangulation program from a theoretically efficient CREW PRAM algorithm. Compared to previous work, the resulting implementation is not limited to datasets with a uniform distribution of points, achieves significantly 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 distributed-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.