一种基于松散八叉树的复杂场景可见性裁剪算法

针对传统八叉树方法的不足,在采用松散八叉树组织场景、利用八叉树空间划分优点的同时弥补其局限性.为提高遮挡查询效率,将子节点依视点排序,针对复杂场景采用双层裁剪技术以进一步提高性能.实验结果表明,文中算法对深度复杂度高、面片数量大的复杂场景具有较好的裁剪效率,能够很好地满足实时绘制的要求.

Visibility Culling for Complex Scene Based on a Loose Octree Structure

To eliminate the drawbacks of traditional octree structure and make full use of its advantages in visibility culling, we organize the scene into a loose octree structure. The nodes of the hierarchy are processed into a front-to-back order in order to improve performance. By the analysis to the complex scene, a double-layer visibility culling algorithm is proposed, and the algorithm combines view frustum culling, detail culling and occlusion culling methods. The results of experiments prove its high efficiency for handling complex scenes with large amount of triangles in high depth.