Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme

Wenzhou Wu, Yikang Rui, Fenzhen Su, Liang Cheng, Jiechen Wang
2014 GIScience & Remote Sensing  
2014): Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-andconquer scheme, GIScience & Remote Sensing To link to this article: http://dx. To increase the efficiency when processing large data sets, a novel parallel algorithm is proposed for constructing the Delaunay triangulation of a planar point set based on a twofold-divide-and-conquer scheme. This algorithm automatically divides the planar point set into several non-overlapping subsets along the
more » ... is and y-axis directions alternately, according to the number of points and their spatial distribution. Next, the Guibas-Stolfi divide-and-conquer algorithm is applied to construct Delaunay subtriangulations in each subset. Finally, the sub-triangulations are merged based on the binary tree. All three sequential steps are processed using multitasking parallel technology. Our results show that the proposed parallel algorithm is efficient for constructing the Delaunay triangulation with a good speed-up.
doi:10.1080/15481603.2014.946666 fatcat:jx6l4qc3xfbdfbe2xt4pnt6wcy