At present the most important things on scene rendering in computer graphics are fidelity and efficiency. In order to achieve these goals, a considerable number of applications require a data structure like a tree to manage the entire scene. Searching the scene means to traversal the tree and moving objects in the scene means to recreate the tree, which are very costly but unavoidable process. In this paper, we establish an octree for managing the whole scene and encode the nodes in the tree. Through a simple process of calculation from one node?s code, we can get this node?s adjacent nodes? code. With the orderly structure of the octree, we have obtained the target that is searching the nodes in the octree and recreating part of the octree efficiently.