The Surface Reconstruction Of Delaunay Triangulation Based On Scattered Points

This paper presents an algorithm on 3-D surface reconstruction based on scattered points which are triangulated by Delaunay method. First, the algorithm triangulates with these scattered points in plane and get some triangles and some interior points for each of these triangles, then calculates the coordinate of each interior point as well as its elevation by different interpolation methods.Last, the algorithm triangulates with all the points and generates triangular patches in 3-D space and compares the 3-D surfaces that are generated by different interpolation methods. The experiment result and complexity analysis of the algorithm show that the algorithm is simple and easy with achieving expected results.Also it costs less time to complete reconstruction and the real degree of the surface are very high.