基于自适应二叉树的场景视锥体裁剪算法

View Frustum Culling Algorithm for Scene Based on Adaptive Binary Tree

建立逼真而丰富的三维场景是可视化领域的主要任务.场景的数据管理和可见性判断对后续渲染的质量和效率起到了至关重要的作用.为了弥补传统场景组织方式在实际应用中的缺陷,本文采用自适应二叉树场景组织算法对场景进行管理,采用层次化裁剪的方式对场景树的节点进行视锥体裁剪,在裁剪过程中所操作的对象是节点中的包围球和包围盒.实验表明,这种基于包围球和包围盒的层次化的视锥体裁剪算法大大的减少了参与裁剪的节点的数量,提高了裁剪的精确性,具有较好的裁剪效率和较高的稳定性.

Building realistic and rich 3D scenes is the main task of visualization.The data management and visibility judgments of the scene play a crucial role in the quality and efficiency of subsequent rendering.In order to make up for the shortcomings of traditional scene organization in practical application,this study adopts the adaptive binary tree scene organization algorithm to manage the scene,and uses the hierarchical cutting method to cut the nodes of the scene tree.In the process of cutting,the object of the operation is the bounding sphere and bounding box in the node.Experiments show that this layered algorithm based on the bounding sphere and bounding box greatly reduces the number of nodes involved in cutting and improves the accuracy of cutting.It has better cutting efficiency and high stability.