Abstract: A distributed parallel algorithm to accelerate the speed of Delaunay triangulation for large data set of scattered data points is presented.The algorithm is fault-tolerant and has the ability to self load-balancing.The design and implementation techniques are discussed in detail.The algorithm's complexity is also analyzed.Experiment results illustrate the efficiency of the algorithm.