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

矿体信息的八叉树存储和检索技术
引用本文:韩国建,郭达志,等.矿体信息的八叉树存储和检索技术[J].测绘学报,1992,21(1):13-17.
作者姓名:韩国建  郭达志
作者单位:中国矿业大学
摘    要:近几年来,在计算机绘图、计算机视觉和数字图象处理等方面三维目标的八叉树表示成为热门论题。本文介绍一种八叉树编码,并将它应用于矿体信息的存储和检索,取得了明显的效果。针对八叉树的构成较费机时的问题,我们提出了一种从三维栅格变换成八叉树的算法,并在VAX3100型工作站上试验。结果表明,所提出的算法其时间复杂度与栅格数大体呈线性关系,用八叉树存储矿体信息占用的存储空间一般仅为栅格表示的10-30%。

关 键 词:矿体  信息  八叉树  数据结构  表示法

STORAGE AND INDEXING OF OREBODYINFORMATION USING OCTREES
Han Guojian. Guo Dazhi Jin. Xuelin.STORAGE AND INDEXING OF OREBODYINFORMATION USING OCTREES[J].Acta Geodaetica et Cartographica Sinica,1992,21(1):13-17.
Authors:Han Guojian Guo Dazhi Jin Xuelin
Institution:China Universitg of Mining and Technology
Abstract:: The octree representation of three-dimmensional (3D) objects is a topic that has been studied in computer graphics, computer vision and digital image processing for a few years. In this paper, octree encoding is described and used for storage and indexing of orebody information. An algorithm of converting 3D rasters to octrees is presented. Ex periments in VAX station 3100 demonstrate the fact that the CPU time for constructing on octree from 3D rasters is proportional to the number of voxels and the storage space in octree is 10 to 30 percent of the space in 3D raster.
Keywords::Octrees  Orebody Information  3D Representation Data Structure
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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