An Improved Data Structure for Octree
改进的八叉树数据结构

An improved data structure for octrees, which reduces the redundancy of the original octree, is presented. The number of nodes of the improved octree is less than one-eighth of that of the original octree, and the storage requirement is even less. Since the logical structures of both octrees are identical,all the algorithms on the original octree can be adopted on the improved octree and will be faster.