Parallel 3 D Delaunay Triangulation

The paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on DeWall, an E triangulator based on an original interpretation of the divide & conquer paradigm. The second is based on an incremental construction algorithm. The parallelization strategies are presented and evaluated. The target parallel machine is a distributed computing environment, composed of coarse grain processing nodes. Results of first implementations are reported and compared with the performance of the serial versions running on a Unix workstation.

[1]  David P. Dobkin,et al.  Primitives for the manipulation of three-dimensional subdivisions , 1987, SCG '87.

[2]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

[3]  Leila De Floriani,et al.  Surface representations based on triangular grids , 1987, The Visual Computer.

[4]  Ivan Stojmenovic,et al.  On parallel computation of Voronoï diagrams , 1989, Parallel Comput..

[5]  Arne Maus,et al.  Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.

[6]  Mohan S. Kankanhalli,et al.  Geometric computing and uniform grid technique , 1989 .

[7]  J. R. Davy,et al.  A Note on Improving the Performance of Delaunay Triangulation , 1989 .

[8]  Leonidas J. Guibas,et al.  Randomized Incremental Construction of Delaunay and Voronoi Diagrams , 1990, ICALP.

[9]  Chang-Sung Jeong.  An improved parallel algorithm for constructing Voronoi diagram on a mesh-connected computer , 1991, Parallel Comput..

[10]  Incremental topological flipping works for regular triangulations , 1992, SCG '92.

[11]  Arie E. Kaufman.  Volume visualization , 1996, CSUR.

[12]  Chang-Sung Jeong.  Parallel Voronoi diagram in L1(Linfty) metric on a mesh-connected computer , 1991, Parallel Comput..

[13]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[14]  Chandrasekhar Narayanaswami.  Parallel processing for geometric applications , 1992 .

[15]  Andrew M. Day,et al.  Parallel implementation of 3D convex-hull algorithm , 1991, Comput. Aided Des..

[16]  Francis Sullivan,et al.  Parallelizing Computational Geometry: First Steps , 1996, Applications on Advanced Architecture Computers.

[17]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[18]  D. H. McLain,et al.  Two Dimensional Interpolation from Random Data , 1976, Comput. J..

[19]  Rex A. Dwyer.  A faster divide-and-conquer algorithm for constructing delaunay triangulations , 1987, Algorithmica.