基于红黑树与K-D树的LiDAR数据组织管理

发布时间：2018-07-06 20:18

本文选题：LiDAR + 红黑树　；参考：《长江科学院院报》2016年11期

【摘要】：LiDAR点云是由海量的激光离散脚点组成的三维点集,在平面以及垂直方向上均分布有数量不均的离散点。LiDAR点云离散点相互之间缺乏空间拓扑关系,所以建立适当的数据组织结构对LiDAR点云进行组织是对LiDAR点云进行处理的基础。根据LiDAR点云的数据结构特点,利用红黑树与K-D树建立一种"非空"规则立方体格网和K-D树相结合的双层次数据结构,用于LiDAR点云的组织管理,从而降低结构冗余和提高索引效率。
[Abstract]:LiDAR point cloud is a three-dimensional point set composed of massive laser discrete foot points. There are uneven number of discrete points in the plane and vertical direction. There is no spatial topological relationship between the discrete points of LiDAR point cloud. Therefore, it is the foundation of LiDAR point cloud processing to set up appropriate data organization structure to organize LiDAR point cloud. According to the data structure characteristics of LiDAR point cloud, a double-layer data structure based on the combination of "non-empty" rule cube grid and K-D tree is established by using red-black tree and K-D tree, which can be used in the organization and management of LiDAR point cloud. In order to reduce structural redundancy and improve the efficiency of the index.
【作者单位】：云南省水利水电勘测设计研究院;长江科学院空间信息技术应用研究所;
【基金】：云南省水利厅水资源费项目(41501558) 云南省水利重大科技项目(CKSK2015852/KJ)
【分类号】：TP751

【相似文献】