一种快速三维散乱点云的三角剖分算法  

A Fast Triangulation Algorithm for Unorganized 3-D Points

作　　者：陈伟[1] 刘肖琳[1] 

机构地区：[1]国防科技大学机电工程与自动化学院,湖南长沙410073

出　　处：《计算机仿真》2009年第9期338-341,共4页Computer Simulation

摘　　要：改进了一种三维散乱点云三角剖分算法。三角剖分是点云数据曲面重构的主要算法之一,但针对三维散乱点云的三角剖分存在剖分效率不高,剖分得到的三角曲面形状无法控制,细节特征表现不足的问题。提出了基于空间栅格划分的三角剖分算法,并提出了一个新的评价函数,以控制三角网格曲面的生长。实验证明,改进后的算法极大的提高了剖分效率,而且能保证最终生成的三角网格曲面平滑而保有丰富的细节特征,适用于在虚拟现实、曲面重构等领域推广使用。A triangulation algorithm for three dimensional unorganized point clouds is improved in this paper. The Delaunay triangulation is one of the main algorithms of surface reconstruction. But the efficiency of the triangulation for three dimensional unorganized point is very low ; and it is difficult to control the shape of the trigons and express the detail characters of the real surface well. To solve these problems, the paper proposed a new triangulation algorithm based on space grids partition, and developed a new criterion function to control the growth of the triangle surface. The result of experiment shows that the efficiency of the improved algorithm is greatly advanced, and the triangle grid surface produced by the improved algorithm is smooth and preserves detail characters. It＇ s suited to popularize in virtual reality, surface reconstruction, and some other field.

关 键 词：三角剖分 八叉树搜索 生长法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]