基于八叉树网格的点云数据精简方法研究  

Data point reduction on octree cube algorithm

作　　者：周波[1] 陈银刚[1] 顾泽元[1] 

机构地区：[1]黑龙江科技学院计算机与信息工程学院,哈尔滨150027

出　　处：《现代制造工程》2008年第3期64-67,共4页Modern Manufacturing Engineering

摘　　要：提出一种基于八叉树网格的点云数据精简方法,该方法利用八叉树来建立散乱点云数据之间的几何拓扑关系,计算出包围盒内点云的平均法矢与点法的夹角,依据夹角的大小作为立方体是否再分的条件,保留其立方体内最接近平均法矢方向的一个点,从而达到精简目的。Presented a reduced method for point cloud data on oetree cube. The topological relation of scattered points is built by oetree. The normal vectors of the points in cubic box can be calculated. Weather or not cube is subdivided according to the angle between the average normal vector of all points and the normal vector of the point in the cubic box. The point whose normal vector is the nearest to the average of all normal vectors in cubic box will be preserved. The method can reduce the data point more effectively on certain liven condition.

关 键 词：点云数据 八叉树网格 法矢 非均匀网格 

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