一种空间曲面上散乱数据的快速三角剖分新算法

在现有三角剖分方法研究的基础上,提出了一种空间曲面上点云数据的快速三角剖分新算法。以区域生长法为主导,通过表面法向量向外原则提出了一种种子三角形选取与构造的新方法,改进生长算法,采用逆时针方式搜寻最优扩展点来生成三角形网格。该算法的总体时间复杂度为O（KN）,能够快速高质量的生成三角网格模型。

A New Quickly Triangulation Algorithm of A Unorganized Point on the Surface Space

This paper is based on the analysis of current triangulation method,based on surface space a new triangulation method is proposed. In this paper an improved direct space partition strategy is put forwards,based on the surface of vector must be field, a method of seed triangulation is proposed, by improving the grown triangulation, Searching for the optimal point expansion use of anti-clockwise way. Algorithm to the overall time complexity is o（KN）,could quickly generate a high-quality triangular grid model.