Research based on the point cloud adaptive algorithm of Delaunay

This paper mainly researches the 3D point cloud of Delaunay algorithm. Based on the advantages of the Delaunay divide-conquer algorithm and point-by-point insertion algorithm, we provide a kind of adaptive algorithms which has the ability to adapt three-dimensional border point and is able to optimize the algorithm by using point cloud block density distribution of dynamic management approach. Meanwhile, the results of test show that this method owns the characteristics of highly adaptive capacity, configuration network of good quality and high efficiency of the algorithm.