基于多策略的三角网格面快速重构算法  

A Fast Surface Reconstruction Algorithm Based on Muti-strategies

作　　者：倪小军[1] 姜晓峰[1] 葛亮[1] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006

出　　处：《微电子学与计算机》2011年第1期74-77,82,共5页Microelectronics & Computer

基　　金：国家自然科学基金项目(60775045)

摘　　要：针对三维散乱点云模型,设计了一种基于多策略的三角网格面快速重构算法.该算法首先利用自适应策略寻找自适应k邻,将其进行投影后在局部区域利用相交不可见策略建立顶点连接关系,在此基础上利用角度阈值策略和Delaunay准则变换策略对顶点关系进行优化,最后将此顶点关系逆映射到三维空间,得到三维点之间的连接关系,从而达到三角网格面快速重构的目的.实验结果表明此算法简单高效,处理速度快,重构效果好,并且对点云数据均匀性要求相对不高.In this paper,according to some available researches,a fast surface reconstruction algorithm based on muti-strategies is presented for three-dimensional scattered points.In this algorithm,we search the k-neighbor points by using adaptive search strategy and project these points onto local tangent planes at first,then we establish the connection relationships by the strategy of intersection is not visible.After that,we can optimize the relationship of points by angle threshold strategy and Delaunay criterion exchange strategy.At last,the connection of these points is mapped directly to 3-dimensional space,and we obtain the relationships of the points to reconstruct the surface quickly.Experiments show that the algorithm is easy and effective,and it can efficiently reconstruct the 3D surface with a faster speed.

关 键 词：快速重构 散乱点云 多策略 三角网格 

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