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.
|
241
|
Vector Models for Data-Parallel Computing
– Blelloch
- 1990
|
|
230
|
Gaussian elimination is not optimal
– STRASSEN
- 1969
|
|
224
|
The Quickhull algorithm for convex hulls
– Barber, Dobkin, et al.
- 1996
|
|
222
|
Triangle: engineering a 2d quality mesh generator and Delaunay triangulator
– Shewchuk
- 1996
|
|
137
|
Voronoi diagrams and Delaunay triangulations
– Fortune
- 1992
|
|
133
|
Leeuwen. Maintenance of configurations in the plane
– Overmars, van
- 1981
|
|
132
|
Implementation of a portable nested data-parallel language
– Blelloch, Chatterjee, et al.
- 1994
|
|
96
|
Preparata and Michael Ian Shamos. Computational Geometry: An Introduction
– Franco
- 1985
|
|
87
|
Voronoi diagrams—A survey of a fundamental geometric data structure
– AURENHAMMER
- 1991
|
|
60
|
Transforming high-level data-parallel programs into vector operations
– Prins, Palmer
- 1993
|
|
57
|
Parallel computational geometry
– Aggarwal, Chazelle, et al.
- 1988
|
|
45
|
A faster divide-and-conquer algorithm for constructing Delaunay triangulations
– Dwyer
- 1987
|
|
43
|
A comparison of sequential Delaunay triangulation algorithms
– Su, Drysdale
- 1997
|
|
37
|
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
– Chan, Snoeyink, et al.
- 1995
|
|
33
|
PMRSB: parallel multilevel recursive spectral bisection
– Barnard
- 1995
|
|
29
|
Parallel constrained delaunay meshing
– Chew, Chrisochoides, et al.
- 1997
|
|
27
|
Algorithm 63 (partition) and algorithm 65 (find
– Hoare
- 1961
|
|
17
|
A data-parallel algorithm for the three-dimensional Delaunay triangulation and its implementation
– Teng, Sullivan, et al.
- 1993
|
|
16
|
Polling: A new randomized sampling technique for computational geometry
– Reif, Sen
- 1989
|
|
14
|
Evaluation of parallelization strategies for an incremental Delaunay Triangulator
– Cignoni, Laforenza, et al.
- 1995
|
|
13
|
Parallel 3D Delaunay triangulation
– Cignoni, Montani, et al.
- 1993
|
|
11
|
Porting a vector library: a comparison of
– Hardwick
- 1994
|
|
10
|
The divide-and-conquer paradigm as a basis for parallel language design
– Axford
- 1992
|
|
10
|
A note on improving the performance of Delaunay triangulation
– Davy, Dew
- 1989
|
|
10
|
Parallel implementation of an algorithm for Delaunay triangulation
– Merriam
- 1992
|
|
10
|
Efficient parallel algorithms for closest point problems
– Su
- 1994
|
|
9
|
An efficient implementation of nested data parallelism for irregular divide-and-conquer algorithms
– Hardwick
- 1996
|
|
7
|
Dafna Talmor. Developing a practical projection-based parallel Delaunay algorithm
– Blelloch, Miller
- 1996
|
|
7
|
Dynamic load balancing in a 2D parallel Delaunay mesh generator
– Verhoeven, Weatherill, et al.
- 1995
|
|
6
|
A Dynamic and Recursive Parallel Algorithm for Constructing Delauney Triangulations
– Ding, Densham
- 1994
|
|
5
|
Srinivas Aluru, and Sanjay Ranka. Concatenated parallelism: A technique for efficient parallel divide and conquer
– Goil
- 1996
|
|
5
|
An optimal mesh computer algorithm for constrained Delaunay triangulation
– Guha
- 1994
|
|
5
|
Practical Parallel Divide-and-Conquer Algorithms
– Hardwick
- 1997
|
|
4
|
Triangulation, Voronoi diagram, and convex hull in k-space on mesh-connected arrays and hypercubes
– Holey, Ibarra
- 1991
|
|
2
|
Colm ' O D'unlaing. Merging free trees in parallel for efficient Voronoi diagram construction
– Cole, Goodrich
- 1990
|
|
1
|
Implementation and evaluation of an efficient 2D parallel Delaunay triangulation algorithm
– Hardwick
- 1997
|
