摘要
基于增量扩散法的思想,提出并实现了一个散乱点云的三角网格重构算法,算法首先利用体素网格的散列表对散乱点进行组织,然后在确定了初始种子三角形的基础上,基于活动边扩展规则构造新的三角形,使网格不断向周围扩展直到活动边表空为止,最后算法合并棱边并计算每个三角形的顶点法矢,最终构造出散乱点云的三角网格。
Based on region-growing idea, a triangular mesh reconstruction algorithm for points cloud is presented. The algorithm first organizes the point cloud into hash table of voxels in voxel grid. Then after determined the seed triangles and the origin active edges, the algorithm searches a new point to form a new triangle with a active edge until the active edge list is empty and the triangular mesh grows. At last the algorithm merges the edges, calculates the nomal of each vertex for each triangle and the triangular mesh is reconstructed.
出处
《计算机工程》
CAS
CSCD
北大核心
2005年第15期30-32,共3页
Computer Engineering
关键词
散乱点云
三角网格
网格重构
Point clouds
Triangular mesh
Mesh reconstruction
