Title :
A Parallel 3D Delaunay Triangulation Method
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., China Univ. of Technol., Taipei, Taiwan
Abstract :
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.
Keywords :
mesh generation; domain-decomposition approach; mesh generation method; parallel 3D Delaunay triangulation method; processor communications; Algorithm design and analysis; Arrays; Computers; Merging; Mesh generation; Program processors; Three dimensional displays; Delaunay triangulation; mesh generation; parallel computing;
Conference_Titel :
Parallel and Distributed Processing with Applications (ISPA), 2011 IEEE 9th International Symposium on
Conference_Location :
Busan
Print_ISBN :
978-1-4577-0391-1
Electronic_ISBN :
978-0-7695-4428-1
DOI :
10.1109/ISPA.2011.52
