长江科学院院报 ›› 2016, Vol. 33 ›› Issue (11): 32-35.DOI: 10.11988/ckyyb.20160854

• 遥感技术应用 • 上一篇    下一篇

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

吴波涛1,张 煜2,陈文龙2,沈定涛2,魏思奇2   

  1. 1.云南省水利水电勘测设计研究院,昆明 650021;2.长江科学院 空间信息技术应用研究所,武汉 430010
  • 收稿日期:2016-08-20 出版日期:2016-11-20 发布日期:2016-11-08
  • 通讯作者: 张 煜(1971-),男,山东阳谷人,高级工程师,博士,研究方向为摄影测量与遥感,(电话)18986061273(电子信箱)zhangyu_1999@126.com。
  • 作者简介:吴波涛(1970-),男,云南呈贡人,高级工程师,研究方向为工程测量与摄影测量,(电话)13987116160(电子信箱)wbt5190523@126.com。
  • 基金资助:

    云南省水利厅水资源费项目(41501558);云南省水利重大科技项目(CKSK2015852/KJ)

Data Organization and Management of LiDAR Based onRed-black Tree and K-D Tree

WU Bo-tao1 , ZHANG Yu2 , CHEN Wen-long2, SHEN Ding-tao2, Wei Si-qi2   

  1. 1.Yunnan Institute of Water & Hydropower Engineering Investigation, Design and Research, Kunming650021, China;
    2.Spatial Information Technology Application Department, Yangtze River Scientific Research Institute, Wuhan 430010, China
  • Received:2016-08-20 Online:2016-11-20 Published:2016-11-08

摘要:

LiDAR点云是由海量的激光离散脚点组成的三维点集,在平面以及垂直方向上均分布有数量不均的离散点。LiDAR点云离散点相互之间缺乏空间拓扑关系,所以建立适当的数据组织结构对LiDAR点云进行组织是对LiDAR点云进行处理的基础。根据LiDAR点云的数据结构特点,利用红黑树与K-D树建立一种“非空”规则立方体格网和K-D树相结合的双层次数据结构,用于LiDAR点云的组织管理,从而降低结构冗余和提高索引效率。

关键词: LiDAR, 红黑树, K-D树, 数据结构, 数据组织, 立方体网格

Abstract:

LiDAR point cloud is a 3D point set composed of massive discrete laser dots which exist in both plane and vertical directions. Because of lacking space topological relations among the discrete dots of LiDAR point cloud, it is important to establish an appropriate data structure for LiDAR point cloud as the foundation of LiDAR processing. According to the structural characteristics of LiDAR point cloud data, a two-level data structure with “non-null” regular cube grid and K-D tree is established for the organization and management LiDAR point cloud using red-black tree and K-D tree to build. The structure could reduce the structural redundancy and improve indexing efficiency.

Key words: LiDAR, red-black tree, K-D tree, data structure, data organization, regular cube grid

中图分类号: