基于自适应八叉树的三维点云快速拾取方法研究
|
摘要
针对逆向工程中大规模点云数据快速拾取问题,对当前三维图形拾取基本方法进行了研究,对点云拾取的基本流程和点云快速拾取的关键问题进行了分析,提出了一种基于自适应八叉树的三维点云快速拾取方法。当用户在计算机屏幕上给出拾取多边形后,首先基于点云分布密度,对点云数据进行了自适应八叉树划分;然后对八叉树节点进行了投影,在屏幕上形成了八叉树节点的投影多边形,并对拾取多边形建立了矩形包围盒;接着对八叉树投影多边形和拾取多边形的矩形包围盒进行了相交检测,将不与矩形包围盒相交的八叉树节点包含的点云去除,从而缩小了点云拾取所需判断的范围,提升了拾取效率。最后对不同分布密度点云进行了定面积的拾取实验。实验结果表明,该点云拾取方法的点云分布密度越大,拾取时间相对越短,算法具有较高的拾取速度和准确度。
Aiming at the quick picking problem of massive point cloud data in reverse engineering,the basic picking method of 3D graphics currently was researched,the basic process of point cloud picking and the key problem of quick picking was analyzed,a quick picking algorithm for 3D point cloud based on adaptive octree was proposed. After the picking polygon was given by the user on screen,firstly,the adaptive octree division based on the distribution density of point cloud data was made,then the projection of the octree node was made and the octree projected polygon on the screen was formed,the rectangular bounding box of the picking polygon was established,then the intersection detection between octree projected polygon and rectangular bounding box of the picking polygon was executed,the point cloud of the octree node not intersected with the rectangular bounding box was removed,thereby the point cloud picking judgment was reduced and the picking efficiency was improved. Finally,a picking test under different point cloud distribution density was conducted. The results indicate that the greater the density of point cloud distribution,the picking time is relatively shorter,the algorithm has a high picking speed and accuracy.
Aiming at the quick picking problem of massive point cloud data in reverse engineering,the basic picking method of 3D graphics currently was researched,the basic process of point cloud picking and the key problem of quick picking was analyzed,a quick picking algorithm for 3D point cloud based on adaptive octree was proposed. After the picking polygon was given by the user on screen,firstly,the adaptive octree division based on the distribution density of point cloud data was made,then the projection of the octree node was made and the octree projected polygon on the screen was formed,the rectangular bounding box of the picking polygon was established,then the intersection detection between octree projected polygon and rectangular bounding box of the picking polygon was executed,the point cloud of the octree node not intersected with the rectangular bounding box was removed,thereby the point cloud picking judgment was reduced and the picking efficiency was improved. Finally,a picking test under different point cloud distribution density was conducted. The results indicate that the greater the density of point cloud distribution,the picking time is relatively shorter,the algorithm has a high picking speed and accuracy.
引文
[1]刘锋,黄勇.基于逆向工程的空调遥控器三维模型设计研究[J].机电工程.2014,31(10):1270-1273.
[2]王剑,陆国栋,谭建荣.三维场景中图形对象的拾取方法[J].机械,2004,31(7):29-32.
[3]徐胜攀,刘正军,左志权.大规模三维点云快速拾取技术研究[J].计算机工程与设计.2013,34(8):2764-2768.
[4]姚继权,李晓豁.计算机图形学人机交互中三维拾取方法的研究[J].工程设计学报,2006,13(2):116-120.
[5]朱明亮,董冰,王祎,等.三维场景中基于视口空间的拾取算法[J].工程图学学报,2008,29(2):94-97.
[6]张嘉华,梁成,李桂清.GPU三维图元拾取[J].工程图学学报.2009,30(1):46-52.
[7]付昕乐,王晏民,黄明.基于GPU的点云拾取[J].测绘通报.2013,51(S1):54-57.
[8]夏仁波,刘伟军,王越超.点在平面多边形内外的判断方法[J].机械工程学报.2006,42(3):130-135.
[9]陈义仁.逆向工程中散乱点云预处理相关算法研究[D].合肥:中国科学技术大学信息科学技术学院,2011.
[10]刘晓东,刘国荣,王颖,等.散乱数据点的k近邻快速搜索算法[J].微电子学与计算机,2007,24(12):23-26.
[2]王剑,陆国栋,谭建荣.三维场景中图形对象的拾取方法[J].机械,2004,31(7):29-32.
[3]徐胜攀,刘正军,左志权.大规模三维点云快速拾取技术研究[J].计算机工程与设计.2013,34(8):2764-2768.
[4]姚继权,李晓豁.计算机图形学人机交互中三维拾取方法的研究[J].工程设计学报,2006,13(2):116-120.
[5]朱明亮,董冰,王祎,等.三维场景中基于视口空间的拾取算法[J].工程图学学报,2008,29(2):94-97.
[6]张嘉华,梁成,李桂清.GPU三维图元拾取[J].工程图学学报.2009,30(1):46-52.
[7]付昕乐,王晏民,黄明.基于GPU的点云拾取[J].测绘通报.2013,51(S1):54-57.
[8]夏仁波,刘伟军,王越超.点在平面多边形内外的判断方法[J].机械工程学报.2006,42(3):130-135.
[9]陈义仁.逆向工程中散乱点云预处理相关算法研究[D].合肥:中国科学技术大学信息科学技术学院,2011.
[10]刘晓东,刘国荣,王颖,等.散乱数据点的k近邻快速搜索算法[J].微电子学与计算机,2007,24(12):23-26.