基于多级线性结构和规则分块的虚拟八叉树  

Virtual Octree Model Based on Hierarchical Linear Structure and Regular Blocks

作　　者：吕广宪[1] 潘懋[1] 宋扬 徐绘宏[1] 

机构地区：[1]北京大学地球与空间科学学院造山带与地壳演化教育部重点实验室,北京100871 [2]北京国研信息科技有限公司,北京100032

出　　处：《计算机工程》2007年第23期3-5,共3页Computer Engineering

摘　　要：提出一种基于多级线性结构和规则分块、无指针/无位置码的虚拟八叉树模型,具有高效的结点访问效率和存储空间压缩效率,实现了指针八叉树在时间效率、线性八叉树在空间效率两方面优势的统一。新模型能够对三维实体及其内部的非均质属性进行建模,可以保证各种可视化与分析算法的处理效率,在空间信息系统和体图形学等实体建模相关的领域中具有重要的研究意义和应用价值。Some optimizations may be applied to a specific algorithm, but they are inadequate to other algorithms in system. Based on hierarchical linear structure and regular blocks, this paper presents a virtual octree model without any pointer or location information in octants. The new model has high efficiency both on access and storage, and unifies the pointer-based octree and the linear octree. The virtual octree model represents the solid and its inner attributes, and also keeps high performance of visualization and analysis, and has wide applications in GIS and other areas related to volume graphics.

关 键 词：八叉树 实体建模 体图形学 真三维 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]