Space Modeling Of Three-dimensional Set Of Points Algorithm Research And Implementation

3D surface reconstruction rapidly and accuratly by discrete vertex collection has very important significance in many field such as virtual environment,computer vision,reverse engineering.It is also an important method for 3D Visualization.This paper introduce the related algorithms currently.Introduce the basic principle of Sculpture Algorithm,Distance Function Algorithm,Surface Grow Algorithm and Mapping Algorithm.Analysis their Advantages and disadvantages.This paper also introduce some theory related to 3D surface reconstruction,for example Visualization, discrete vertex collection,convex hull,Voronoi Graphics and Delaunay Triangles,medial axis andε-sampling,Restricted Delaunay Triangles,the condition of Topological homeomorphism.Then introduce a algorithm for 3D surface reconstruction,and do the experiment for this algorithm.The algorithm's basic steps are as fllows:it is begin with the import of discrete vertex collection,first use incremental insertion method to create Tetrahedron network,it is also create topology between vertex collection,it is also finish the Delaunay Triangulation.Then,choose Restricted triangle using the angle imformation between the normal of vertex and the Delaunay triangle.Last,choose a seed triangle,and form this triangle,create the surface triangles network based on the adjacency triangles of extension edge.By the end of this paper,It has a Summary of this paper's research,and proposed the problem to be resolved.