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

基于八叉树及KD 树的混合型点云数据存储结构
引用本文:廖丽琼,白俊松,罗德安.基于八叉树及KD 树的混合型点云数据存储结构[J].计算机系统应用,2012,21(3):87-90.
作者姓名:廖丽琼  白俊松  罗德安
作者单位:北京建筑工程学院测绘工程系,北京,100044
摘    要:通过对现有点云数据存储结构进行综合分析及比较,提出了一种基于八叉树及KD树的混合型点云数据存储结构模型,文中对该模型的基本原理、实现步骤及快速索引的建立等进行了全面的论述,最后以一组实测数据为例,比较了KD树、八叉树和本文提出的混合结构三种不同数据组织方式的检索效率,证明了所提出存储结构的有效性及实用性。

关 键 词:海量点云  数据结构  三维激光扫描  存储结构  索引
收稿时间:2011/6/18 0:00:00
修稿时间:2011/7/24 0:00:00

Integrated Point Cloud Storage Structure Based on Octree and KDTree
LIAO Li-Qiong,BAI Jun-Song and LUO De-An.Integrated Point Cloud Storage Structure Based on Octree and KDTree[J].Computer Systems& Applications,2012,21(3):87-90.
Authors:LIAO Li-Qiong  BAI Jun-Song and LUO De-An
Affiliation:(Dept.of Surveying and Mapping,Beijing Institute of Construction Engineering and Architecture,Beijing 100044,China)
Abstract:Based on analysis and comparison to existing point cloud storage structures,presents an integrated point cloud storage structure base on Octree and KDTree,describes its basic theory,work flow and index building method,at last a group of real data are employed to check and test the efficiency of Octree,KDTree and presented data structure,and the results shows that presented data structure has higher search efficiency and more suitable for point cloud data storage than the others.
Keywords:huge quantity of point cloud  data structure  3D laser scanning  storage structure  index
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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