Effective occlusion culling for the interactive display of arbitrary models
Hansong Zhang · 1998
As an advanced form of visibility culling, occlusion culling detects hidden objects and prevents them from being rendered. An occlusion-culling algorithm that can effectively accelerate interactive graphics must simultaneously satisfy the following criteria: # Generality. It should be applicable to arbitrary models, not limited to architectural models or models with many large, polygonal occluders. # Significant Speed-up. It should not only be able to cull away large portions of a model, but do so fast enough to accelerate rendering. # Portability and Ease of Implementation. It should contain as few assumptions as possible on special hardware support. It must also be robust (i.e. insensitive to floating-point errors). Based on proper problem decomposition and efficient representations of cumulative occlusion, this dissertation presents algorithms that sa...