摘要
提出一种对无规则点云进行三角网格重构的区域增长算法.重构网格从初始三角形开始,通过2个采取不同生长策略的生长阶段完成生长.第1阶段生长点分布均匀并且密度相对较高的区域,剩下的部分在第2阶段生长;还提出了一种空间划分方法和选择新点生成三角形的方法,并采用了附加三角形提高拓扑操作的可靠性.实验结果说明该算法是快速有效的.
A region-growing algorithm was proposed to reconstruct triangular meshes from unorganized point cloud. Starting from an initial triangle, a triangle mesh grew in two phases based on hybrid strategy, where regions with uniform point distribution usually grow first and then the remaining regions grow. Some other techniques were also introduced including a reasonable space partition scheme to accelerate the algorithm, a proper selection criterion to select candidate points, and an additive topological operation to assure the correctness of topology. Experiments show that the algorithm is efficient and effective.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2006年第9期1426-1431,共6页
Journal of Computer-Aided Design & Computer Graphics
关键词
三角网格重构
区域生长
无规则点云
surface reconstruction
region growing
unorganized point cloud