点到平面距离的点云数据压缩方法  

A point cloud data compression based on the point to plane distance

作　　者：陈朋[1] 周大伟[1] 

机构地区：[1]中国矿业大学环境与测绘学院,江苏徐州221116

出　　处：《测绘科学》2015年第8期117-120,共4页Science of Surveying and Mapping

基　　金：江苏高校优势学科建设工程资助项目(SZBF2011-6-B35)

摘　　要：针对三维激光扫描点云数据采集过密、冗余信息较多,现有压缩算法存在不足的问题,该文提出了基于点到平面距离的散乱点云压缩算法。将该算法与基于三角形法向量夹角和格网法两种现有算法的压缩结果进行比较,通过对比构建的空间三角网可以发现,该文算法对物体特征复杂的部位有较好的压缩效果,且在压缩率较高时,不会使较平缓的部位出现过度压缩而失真的情况。The 3 dimension laser scanning technology is a new data acquisition method. For the dense data processing of point cloud, the paper presented a data compression method of scattered point cloud da- ta based on the point-to-plane distance. The new method of the compression effect was more ideal. The tri- angle net was reconstructed using compressed cloud data. Through comparing the triangle net with two typical algorithms： the adjacent triangle normal vectors included angle and the grid, it was found that this algorithm got preferable results in some substance with complex characteristic. Besides, when there was a higher compression ratio, it also helped to avoid the occurrence of distortion caused by excessive compression of gentle place.

关 键 词：三维激光扫描 点云 数据压缩 点到平面距离 法向量 格网法 

分 类 号：P208[天文地球—地图制图学与地理信息工程]