基于快速Delaunay三角化的散乱点曲面重建算法

A surface reconstruction algorithm for unorganized points based on fast Delaunay triangulation

针对现有三维重建算法速度较慢的问题,提出了一种基于快速Delaunay三角化的散乱数据点的三维重建算法。首先,提出一种新的平面Delaunay三角化插入点目标三角形定位算法,利用插入点的方向搜索线与三角形是否相交以及交点个数加速目标三角形定位,不用额外判断点是否在三角形内;其次,自动检测曲面漏洞,利用凸壳的边界拼接方法进行漏洞弥补。实验结果表明,本算法不仅能较好地重建出三维模型,而且有较高的效率。

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 triangu- lation. The number of intersection points of the direction searching line of the inserted points and the tri- angles 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.