Efficient conservative visibility culling using theprioritized-layered projection algorithm

摘要

We propose a novel conservative visibility culling technique basednon the Prioritized-Layered Projection (PLP) algorithm. PLP is antime-critical rendering technique that computes, for a given viewpoint,na partially correct image by rendering only a subset of the geometricnprimitives, those that PLP determines to be most likely visible. Our newnalgorithm builds on PLP and provides an efficient way of finding thenremaining visible primitives. We do this by adding a second phase to PLPnwhich uses image-space techniques for determining the visibility statusnof the remaining geometry. Another contribution of our work is to shownhow to efficiently implement such image-space visibility queries usingncurrently available OpenGL hardware and extensions. We report on thenimplementation of our techniques on several graphics architectures,nanalyze their complexity, and discuss a possible hardware extension thatnhas the potential to further increase performance