A Fast Triangulation Algorithm for Unorganized 3-D Points

A triangulation algorithm for three dimensional unorganized point clouds is improved in this paper. The Delaunay triangulation is one of the main algorithms of surface reconstruction. But the efficiency of the triangulation for three dimensional unorganized point is very low; and it is difficult to control the shape of the trigons and express the detail characters of the real surface well. To solve these problems,the paper proposed a new triangulation algorithm based on space grids partition,and developed a new criterion function to control the growth of the triangle surface. The result of experiment shows that the efficiency of the improved algorithm is greatly advanced,and the triangle grid surface produced by the improved algorithm is smooth and preserves detail characters. It's suited to popularize in virtual reality,surface reconstruction,and some other field.