A Fast Surface Reconstruction Algorithm Based on Muti-strategies
Ge Liang · Microelectronics & Computer · 2011
In this paper,according to some available researches,a fast surface reconstruction algorithm based on muti-strategies is presented for three-dimensional scattered points.In this algorithm,we search the k-neighbor points by using adaptive search strategy and project these points onto local tangent planes at first,then we establish the connection relationships by the strategy of intersection is not visible.After that,we can optimize the relationship of points by angle threshold strategy and Delaunay criterion exchange strategy.At last,the connection of these points is mapped directly to 3-dimensional space,and we obtain the relationships of the points to reconstruct the surface quickly.Experiments show that the algorithm is easy and effective,and it can efficiently reconstruct the 3D surface with a faster speed.