An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel Computers

Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis large computation time required to obtain the triangulationon an input points set. This time can be reduced by using more than one processor, and several parallel algorithms for Delaunay triangulation have been proposed. In this paper, we propose an improved parallel algorithmfor Delaunay triangulation,which partitions the bounding convex region of the input points set into a number of regions by using Delaunay edges and generates Delaunay triangles in each region by applying an incremental construction approach. Partitioning by Delaunay edges makes it possible to eliminate merging step required for integrating subresults. It is shown from the experiments that the proposed algorithm has good load balance and is more e cient than Cignoni et al.'s algorithm and our previous algorithm.

• Type: Conference
• Year: 1997
• Where: APDC
• Authors: Sangyoon Lee, Chan-Ik Park, Chan-Mo Park
• Keywords: APDC 1997, Delaunay Edges, Delaunay Triangulation, Distributed And Parallel Computing, Parallel Algorithmfor Delaunay