论文信息 - Parallel 3D Delaunay Triangulation

Parallel 3D 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 De Wall, an Ed 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] Arne Maus,et al. Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.

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

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

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

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

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

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

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

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

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

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

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