Bsp And Quadtree-based Scene Management

The goal of Visualization is to create wider more copious scene. Scene Manage is one of its cores. With the development of hardware condition and software techniques, people's request of visualization is increasing too. People want to see more complex and more detailed scene.It is certain that in one period of time, the hardware condition cannot be changed. If there is no algorithm for scene manages, the complexity of the scene is inversely proportional to the rendering speed. In another way, it is very hard to create more complex scene with the fixed hardware condition. There for, it is necessary to study the feature of different scene and regular pattern of people's sight, to summarize the existence of there internal connection, and to search for the algorithm which has nothing to do with the complexity of scene. Also, it is an inevitable trend.This article studies the following three points: Through the study of quad tree, using the part loading and dynamic update method to make it possible to render very huge map, and use the interlocking tiles to implement fast LOD algorithm. Studies the BSP tree (Binary Space Partition Tree), and does some improvement to overcome the defect of traditional BSP tree. We make the new BSP tree have less leave nodes. By using the Portal technique in Quad tree, we can merge the BSP tree and Quad tree together, so that both outdoor terrain scene and indoor scene can be seen at the same time.