摘要
提出一种适用于散乱点云的基于点云法矢量的三维非均匀栅格压缩算法,通过求取k邻近构造出点云的法矢量以反映曲面形状信息,并构造八叉树数据结构对栅格进行细分,通过比较分析,该方法取得了较好的压缩效果。
The paper presents a new data reduction method called 3D non-uniform grids algorithm based on normal value of points that any type data can use. By gaining part geometry information from normal val- ues got by calculating point k nearest neighbors 3D grids are subdivision using octree data structure. After experiments analysis and contrast, this method gets rather good results.
出处
《测绘工程》
CSCD
2011年第6期32-34,37,共4页
Engineering of Surveying and Mapping
关键词
三维激光扫描
点云
数据压缩
非均匀栅格
k邻近
法矢量
3D laser scanning
point cloud
data reduction
uniform grid
k nearest neighbor
normal value
