View Frustum Culling Algorithm for Scene Based on Adaptive Binary Tree

摘要

Enhance the realism of scene rendering and improve the rendering speed of the three-dimensional scene is the main task in the field of visualization. As a key part before the scene is drawn, the organization and visibility judgment of the scene are paid more and more attention, the performance of scene organization and visibility judgment affects the quality of subsequent scene rendering. In order to make up for the shortcomings of the traditional scene organization in practical application, In this paper, adaptive binary tree (ABT) scene organization algorithm is responsible for the scene to be reasonably divided. Based on the structure of the scene, the culling algorithm based on the bounding sphere and the bounding box is responsible for culling the nodes in the scene tree, Objects that are manipulated during culling are the bounding sphere and bounding boxes in the node. Experiments show that the hierarchical view frustum culling algorithm based on the bounding sphere and the bounding box greatly reduces the number of nodes involved in culling, improves the culling accuracy, has better culling efficiency and higher stability, further improve the performance of subsequent scene rendering.