引用本文:孔德武.点云数据的三角剖分及计算机三维重建[J].西南师范大学学报(自然科学版),2019,44(7):87~92
【打印本页】   【HTML】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 37次   下载 35 本文二维码信息
码上扫一扫!
分享到: 微信 更多
点云数据的三角剖分及计算机三维重建
孔德武
河南工业和信息化职业学院 信息工程系, 河南 焦作 454000
摘要:
为了解决直接剖分法因点云数据拓扑结构复杂出现的自交现象,提出了一种基于分治策略的三角剖分方法.首先,对原始点云数据进行平面投影并执行区域分割;其次,在每一个区域内进行直接剖分,剖分过程遵循异侧剖分准则、法向量夹角最大剖分准则、阈值距离剖分准则、最小内角最大剖分准则.最后,按照空间Delaunay剖分准则完成区域之间的连接.实验结果表明,该文提出的剖分方法对于规则曲面点云和非规则曲面点云都具有理想的剖分效果,并且执行速度快.
关键词:  点云数据  三角剖分  分治策略  三维重建
DOI:10.13718/j.cnki.xsxb.2019.07.014
分类号:TP391
基金项目:河南省自然科学基金项目(152300410212).
Triangulation and Computer Three-Dimensional Reconstruction of Point Cloud Data
KONG De-wu
Department of Information Engineering, Henan Vocational College of Industry and Information Technology, Jiaozuo Henan 454000, China
Abstract:
In order to solve the self-intersection of point cloud data caused by complex topological structure, a triangulation method based on divide-and-conquer strategy has been proposed. Firstly, the original point cloud data are projected on a plane and partitioned into regions. Secondly, each region is partitioned directly. The partitioning process follows the criteria of lateral partitioning, maximum normal vector angle partitioning, threshold distance partitioning and maximum minimum internal angle partitioning. Finally, the connection between regions is completed according to the spatial Delaunay partition criterion. The experimental results show that the proposed method has ideal segmentation effect for both regular and irregular surface point clouds, and the execution speed is fast.
Key words:  point cloud data  triangulation  divide and conquer strategy  three-dimensionalreconstruction
手机扫一扫看