基于三维狄洛尼三角网的曲面重建算法

随着三维激光扫描技术应用领域的不断拓展，对点云数据三维建模的需求越来越迫切。曲面重建技术作为三维建模的核心技术之一，在逆向工程、计算机视觉、计算机制图以及虚拟现实等技术领域都有着非常广泛的应用前景。本文提出一种基于三维狄洛尼三角网的曲面重建算法，其本质是一种结合了曲面生长算法思想的贪心算法，即在一定约束条件下，按照最优三角形选择标准，算法从预先构建好的三维狄洛尼三角网中，逐个筛选出最优三角形添加到生长曲面上，最终输出由一系列显式三角形所组成的流形曲面。这种方法对比目前主流的隐式曲面重建算法具有参数依赖性较小、不需要计算法线等优点，并且能够重建地形扫描、建筑物扫描和精细化扫描的点云模型。利用此算法对多种点云模型进行曲面重建试验，结果表明该算法生成曲面质量好、重建效率高、实用性强，能够很好地应用于三维建模领域。

Surface Reconstruction Algorithm Based on 3D Delaunay Triangulation

With the development of 3D laser scanning technology,the demand for 3D modeling of point cloud data is increasing.As one of the core technologies of 3D modeling,surface reconstruction technology has an extremely widespread application prospect in reverse engineering,computer vision,computer graphics and virtual reality technology.This paper presents a surface reconstruction algorithm based on three-dimensional Delaunay triangulation,it is essentially a greedy algorithm,and combined with the idea of surface region growing algorithm.Manifold surface composed of a selection of explicit triangles can be reconstructed by this algorithm under a certain topological limit,the best triangles are selected from the preconstructed 3D Delaunay triangulation according to the appropriate triangle selection criteria by this algorithm,and added to the growing surface one by one.Compared with the current mainstream implicit surface reconstruction algorithm,this method has the advantages of less parameter dependency and no need to calculate normal line,and it can reconstruct the point cloud model of terrain scanning,building scanning and fine scanning.Using this algorithm to reconstruct the surface of a variety of point cloud models,experimental results show that the quality of the surface generated by the algorithm is choiceness,and the efficiency of reconstruction is faster,this surface reconstruction algorithm has stronger practicability and can be better applied in the field of 3D modeling.