by Guy E. Blelloch, Gary L. Miller, Dafna Talmor
in 12th Annual Symposium on Computational Geometry
http://www.cs.berkeley.edu/~jrs/mesh/../meshpapers/BlellochMillerTalmor.ps.gz
Add To MetaCart
Abstract:
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in Scientific Computation. Although there have been many theoretical algorithms for the problem, and some implementations based on bucketing that work well for uniform distributions, there has been little work on implementations for general distributions. We use the well known reduction of 2D Delaunay triangulation to 3D convex hull of points on a sphere or paraboloid. A variant of the Edelsbrunner and Shi 3D convex hull is used, but for the special case when the point set lies on either a sphere or a paraboloid. Our variant greatly reduces the constant costs from the 3D convex hull algorithm and seems to be a more promising for a practical implementation than other parallel approaches. We have run experiments on the algorithm using a variety of distributions that are motivated by various problems that use Delaunay triangulations. Our experiments show that for these distributions we are within a factor of approximately two in work from the best sequential algorithm.
Citations
|
385
|
Primitives for the manipulation of general subdivisions an the computation of voronoi diagrams
– Guibas, Stolfi
- 1985
|
|
222
|
Parallel prefix computation
– Ladner, Fischer
- 1980
|
|
142
|
Closest-Point Problems
– Shamos, Hoey
- 1975
|
|
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
|
|
89
|
The ultimate planar convex hull algorithm
– Kirkpatrick, Seidel
- 1986
|
|
62
|
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
– Dehne, Deng, et al.
- 1995
|
|
61
|
N.: A delaunay based numerical method for three dimensions: generation, formulation, and partition
– MILLER, TALMOR, et al.
- 1995
|
|
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
|
|
23
|
The expected extremes in a Delaunay triangulation
– Bern, Eppstein, et al.
- 1991
|
|
18
|
Parallel solutions to geometric problems on the scan model of computation
– Blelloch, Little
- 1988
|
|
17
|
A data-parallel algorithm for the three-dimensional Delaunay triangulation and its implementation
– Teng, Sullivan, et al.
- 1993
|
|
15
|
In-place techniques for parallel con-vex hull algorithms
– Ghouse, Goodrich
- 1991
|
|
13
|
An O(n log h) time algorithm for the three-dimensional convex hull problem
– Edelsbrunner, Shi
- 1991
|
|
10
|
Parallel implementation of an algorithm for Delaunay triangulation
– Merriam
- 1992
|
|
10
|
Efficient parallel algorithms for closest point problems
– Su
- 1994
|
|
4
|
Merging free trees in parallel for efficient voronoi diagram construction
– COLE, GOODRICH, et al.
- 1990
|
|
3
|
On the distribution of matter within highly flattened galaxies
– Toomre
- 1963
|
|
2
|
Parallel Algorithms for Computational Geometry
– Chow
- 1980
|
|
1
|
Parallel Delaunay triangulation implementation
– Blelloch, Miller, et al.
- 1994
|
|
1
|
Maintenance of configurationsin the plane
– Overmars, Leeuwen
- 1981
|
|
1
|
Polling: A new randomizedsampling technique for computational geometry
– Reif, Sen
- 1989
|
|
1
|
An efficient expectedtime parallel algorithm for Voronoi construction
– Vemuri, Varadarajan, et al.
- 1992
|
