| 一种基于点法矢的三维非均匀栅格压缩算法 |
| |
| 引用本文： | 丁剑,郭英琦,许冰,黄相成,于中伟.一种基于点法矢的三维非均匀栅格压缩算法[J].测绘工程,2011,20(6):32-34,37. |
| |
| 作者姓名： | 丁剑 郭英琦 许冰 黄相成 于中伟 |
| |
| 作者单位： | 沈阳市勘察测绘研究院,辽宁沈阳,110015 |
| |
| 摘 要： | 提出一种适用于散乱点云的基于点云法矢量的三维非均匀栅格压缩算法，通过求取k邻近构造出点云的法矢量以反映曲面形状信息，并构造八叉树数据结构对栅格进行细分，通过比较分析，该方法取得了较好的压缩效果。
|
| 关 键 词： | 三维激光扫描 点云 数据压缩 非均匀栅格 k邻近 法矢量 |
A 3-dimensional non-uniform gird data reduction algorithm based on normal value of points |
| |
| DING Jian,GUO Ying-qi,XU Bing,HUANG Xiang-cheng,YU Zhong-wei.A 3-dimensional non-uniform gird data reduction algorithm based on normal value of points[J].Engineering of Surveying and Mapping,2011,20(6):32-34,37. |
| |
| Authors: | DING Jian GUO Ying-qi XU Bing HUANG Xiang-cheng YU Zhong-wei |
| |
| Institution: | (Shenyang Surveying and Mapping Research Institute, Shenyang 110015, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | 3D laser scanning point cloud data reduction uniform grid k nearest neighbor normal value |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
