期刊文献+

基于改进的八叉树索引与分层渲染的海量激光点云可视化技术 被引量:12

A New LOD Method Based on an Improved Octree Index Structure for the Visualization of Massive Point Cloud
下载PDF
导出
摘要 近年来利用三维激光扫描技术进行的国内各地城市数字化发展迅速,随着硬件技术的升级和扫描范围的逐渐扩大,获得的相应的三维数据可达TB级。因此,如何合理的建立点云索引管理机制,是解决海量点云数据组织和管理的关键问题。本文首先对传统八叉树数据结构的索引方法进行了优化,然后对三维点云分块,建立八叉树索引数据文件,同时用LOD方法对其进行分层抽稀操作,通过建立改进的八叉树与LOD方法相结合的索引,来降低内存的消耗、提高查询的效率,最后根据屏幕显示范围与视角变化实时读取释放点云索引数据,从而实现海量点云数据的可视化。 The using of 3D scanning technology in digital city construction development rapidly, with the upgrade of hardware, the scanned 3D data up to TB.How to establish a point cloud index management mechanism as the key to solving the problem of massive point cloud data organization and management.This paper proposed a optimized index management method based on traditional Octree structure,and using LOD method to divided the massive point cloud data into blocks,then building the corresponding index data files for point cloud data blocks,in order to improve the performance and reduce the memory consumption of visualization of the massive point cloud data.
出处 《软件》 2016年第3期114-117,共4页 Software
关键词 海量点云 八叉树索引 细节层次模型 可视化 Massive Point Cloud Data Octree Level of Details Visualization
  • 相关文献

参考文献5

  • 1Norbert Beckmann,Hans-Peter Kriegel,Ralf Schneider,Bernhard Seeger.The R*-tree: an efficient and robust access method for points and rectangles[J]. ACM SIGMOD Record . 1990 (2)
  • 2支晓栋,林宗坚,苏国中,钟良.基于改进四叉树的LiDAR点云数据组织研究[J].计算机工程与应用,2010,46(9):71-74. 被引量:20
  • 3R. A. Finkel,J. L. Bentley.??Quad trees a data structure for retrieval on composite keys(J)Acta Informatica . 1974 (1)
  • 4Jon Louis Bentley.Multidimensional binary search trees used for associative searching[J]. Communications of the ACM . 1975 (9)
  • 5Jan Elseberg,Dorit Borrmann,Andreas Nüchter.One billion points in the cloud – an octree for efficient processing of 3D laser scans[J]. ISPRS Journal of Photogrammetry and Remote Sensing . 2012

二级参考文献8

  • 1黄先锋,陶闯,江万寿,龚健雅.机载激光雷达点云数据的实时渲染[J].武汉大学学报(信息科学版),2005,30(11):975-978. 被引量:21
  • 2Finkel R A,Bently J L.Quad trees a data structure for retrieval on composite key[J].Acta Informatica, 1974,4( 1 ) : 1-9.
  • 3Bently J L.Multidimensional binary search tree used for associative searching[J].Communications of the ACM, 1975,18(9):509-517.
  • 4Robinson J T.The K-D-B tree:A search structure for large multidimensional dynamic indexes[C]//Proc of ACM-SIGMOD'81,1981.
  • 5Hjaltason G R.Ranking in spatial database[C]//Proceedings of the 4th Symposium on Spatial Database, 1995.
  • 6Chyscmthou Y,Slater M.Computing dynamic changes to BSP trees[C]// Computer Graphics Forum (Eurographics' 92 Proceedings), 1992,11 (3) :321-332.
  • 7李清泉,李必军,陈静.激光雷达测量技术及其应用研究[J].武汉测绘科技大学学报,2000,25(5):387-392. 被引量:153
  • 8李英成,文沃根,王伟.快速获取地面三维数据的LIDAR技术系统[J].测绘科学,2002,27(4):35-38. 被引量:75

共引文献19

同被引文献135

引证文献12

二级引证文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部