A Parallel 3D Delaunay Triangulation Method

Delaunay triangulation is a common mesh generation method in scientific computation. This parallel 3D Delaunay triangulation method uses domain-decomposition approach. With the properties of Delaunay triangulation, this method devise algorithm when merge block triangulations. To reduce the communications between processors, it finds the 3D affected zone that may be modified during the merge of two sub-block triangulations. The merging triangulation can be generated with the search just on the boundary of block triangulations.

[1]  Rainald Löhner,et al.  A parallel advancing front grid generation scheme , 2000, International Journal for Numerical Methods in Engineering.

[2]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[3]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[4]  Les A. Piegl,et al.  Delaunay triangulation using a uniform grid , 1993, IEEE Computer Graphics and Applications.

[5]  Nigel P. Weatherill,et al.  Distributed parallel Delaunay mesh generation , 1999 .

[6]  Nikos Chrisochoides,et al.  Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains , 2002, SCG '02.

[7]  R. Scopigno,et al.  Parallel 3D Delaunay Triangulation , 1993, Comput. Graph. Forum.

[8]  Rainald Löhner.  A parallel advancing front grid generation scheme , 2000 .

[9]  Borut Zalik,et al.  Improvements to randomized incremental Delaunay insertion , 2002, Comput. Graph..

[10]  B. G. Larwood,et al.  Domain decomposition approach for parallel unstructured mesh generation , 2003 .

[11]  P Cignoni,et al.  DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed , 1998, Comput. Aided Des..

[12]  M. S. Shephard,et al.  Parallel three-dimensional mesh generation on distributed memory MIMD computers , 2005, Engineering with Computers.

[13]  C. A. R. Hoare,et al.  Algorithm 64: Quicksort , 1961, Commun. ACM.

[14]  Nikos Chrisochoides,et al.  Parallel Delaunay mesh generation kernel , 2003 .

[15]  Min-Bin Chen.  The Merge Phase of Parallel Divide-and-Conquer Scheme for 3D Delaunay Triangulation , 2010, International Symposium on Parallel and Distributed Processing with Applications.

[16]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[17]  Jirí Zára,et al.  Parallel Delaunay triangulation in E2 and E3 for computers with shared memory , 2005, Parallel Comput..

[18]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[19]  Michael A. Facello,et al.  Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions , 1995, Comput. Aided Geom. Des..