八元树的存储与恢复的一种优化算法  

An Optimized Arithmetic of the Storage and Comeback of Octree

作　　者：陈娟[1] 朱立新[1] 吴彪[1] 

机构地区：[1]电子工程学院203室,安徽合肥230037

出　　处：《电子科技》2004年第6期33-36,共4页Electronic Science and Technology

摘　　要：八元树表示法是紧凑、简洁、直观的基于体积的三维表示方法,文中提出了八元树的存储与恢复的一种优化算法,免除了建树过程中的大量工作,且具有简单明了、占用存储空间小、实用效率高等特点。从实验结果看算法是可行的,能完成八元树的存储与恢复。The octree representation is a compact, concise and direct three-dimensional representation based on bulk. The optimized arithmetic of the storage and comeback of octree is put forward in this article, which involves no such efforts as made in building trees, thus having the characteristic of being simple, efficient and taking up less storage room. Experiment results show that it can realize the storage and comeback of octree.

关 键 词：八元树 优化算法 图像处理 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]