Parallel Delaunay triangulation for object reconstruction

Delaunay triangulation (DT) is a well known method for object reconstruction. There are at least three algorithms to construct triangulation, i.e. in-line (incremental insertion), incremental construction, and divide and conquer. Each of them has trade-off in the implementation on parallel algorithms. Besides sequential algorithms, the strategy of partitioning block of data into sub-block is influences the performance. In this paper, we compare the performance of the two partitioning strategy: Independent Parallel Delaunay triangulation (IPDT) and Dependent Parallel Delaunay Triangulation (DPDT). From the experiment with 10000 data set, IPDT has better speedup on uniform and normal data set distribution, while DPDT has better speedup on bubble and uniform on the vertical belt shape data set distribution.