Dynamic visibility algorithm based on major occluder

The dynamic visibility algorithm based on major occluder for complicated scene with high density is presented. By creating an occluding tree through primary shading objects predefined in the scene, our algorithm can eliminate all objects in the shading area of the shading tree. The algorithm performs high efficiency when the scene is organized according to the binary space partitioning tree and rendered from front to back. We apply a simplified shading proxy to primary shading objects, and present an efficient simplified algorithm for shading objects with box type. Our algorithm has been applied to RTG 3D graphics Toolkits. The ability of increasing the rendering speed for complicated sense has been verified by many practical instances in our work.