海量数据三角网格生成算法

对海量数据散乱密集难以自动得到邻近点间正确拓扑连接关系的问题,给出了一种用于海量数据的基于增量网格扩展的三角剖分方法.该方法以k阶最近邻域算法快速搜寻边界点的最近邻域,以增量算法的边界环为基础向外生成三角形,实现点云数据点之间合理的三角剖分网格建立.对最佳点的选择提出了3种需遵循的新准则,并根据最佳点的位置不同,详细给出了3种网格拓扑操作来构建新三角网格,可以准确的进行三角剖分.车身曲面测量点云的应用实例表明,该算法可以高效,稳定地直接构建出车身曲面三角网格.

Triangular mesh generation algorithm of point clouds

The establishment of topological mesh problem in point clouds preprocessing was researched.To solve the problem obtaining the correct topological relations of the scattered point clouds,a sort of triangulation based on incremental growth was researched for point clouds.Searched the nearest neighbors of boundary points by using the algorithm of k-nearest neighbors quickly,it constructs triangles based on the boundary ring of incremental algorithm,and realizes the construction of topological mesh.Three new cr...