首页 | 本学科首页   官方微博 | 高级检索  
     

基于红黑树与K-D树的LiDAR数据组织管理
引用本文:吴波涛,张煜,陈文龙,沈定涛,魏思奇.基于红黑树与K-D树的LiDAR数据组织管理[J].长江科学院院报,2016(11):32-35.
作者姓名:吴波涛  张煜  陈文龙  沈定涛  魏思奇
作者单位:1. 云南省水利水电勘测设计研究院,昆明,650021;2. 长江科学院 空间信息技术应用研究所,武汉,430010
基金项目:云南省水利厅水资源费项目(41501558),云南省水利重大科技项目(CKSK2015852/KJ)
摘    要:LiDAR点云是由海量的激光离散脚点组成的三维点集,在平面以及垂直方向上均分布有数量不均的离散点。LiDAR点云离散点相互之间缺乏空间拓扑关系,所以建立适当的数据组织结构对LiDAR点云进行组织是对LiDAR点云进行处理的基础。根据LiDAR点云的数据结构特点,利用红黑树与K-D树建立一种"非空"规则立方体格网和K-D树相结合的双层次数据结构,用于LiDAR点云的组织管理,从而降低结构冗余和提高索引效率。

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

Data Organization and Management of LiDAR Based on Red-black Tree and K-D Tree
WU Bo-tao,ZHANG Yu,CHEN Wen-long,SHEN Ding-tao,Wei Si-qi.Data Organization and Management of LiDAR Based on Red-black Tree and K-D Tree[J].Journal of Yangtze River Scientific Research Institute,2016(11):32-35.
Authors:WU Bo-tao  ZHANG Yu  CHEN Wen-long  SHEN Ding-tao  Wei Si-qi
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 process-ing. 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 ef-ficiency.
Keywords:LiDAR  red-black tree  K-D tree  data structure  data organization  regular cube grid
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号