关键词: 曲面重建, 散乱数据点, Delaunay三角剖分, 漏洞填充

Abstract:

To solve the problem of low efficiency in threedimensional reconstruction, we propose a surface reconstruction algorithm for unorganized points based on fast Delaunay triangulation.First,a new algorithm is designed for searching the target triangle of an inserted point in the plane Delaunay triangulation.The number of intersection points of the direction searching line of the inserted points and the triangles is used to speed up locating the target triangle.No extra work is required to determine whether the point is inside the triangle.Second,the holes on the mesh are detected automatically and they are made up by the boundary combination method of convex hull.Experimental results demonstrate the high quality and the efficient performance of the proposed algorithm in processing 3D reconstruction for unorganized points.

Key words: surface reconstruction;unorganized points;Delaunay triangulation;holes filling