Efficient conservative visibility culling using the prioritized-layered projection algorithm
- 1 January 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 7 (4) , 365-379
- https://doi.org/10.1109/2945.965350
Abstract
We propose a novel conservative visibility culling technique based on the Prioritized-Layered Projection (PLP) algorithm. PLP is a time-critical rendering technique that computes, for a given viewpoint, a partially correct image by rendering only a subset of the geometric primitives, those that PLP determines to be most likely visible. Our new algorithm builds on PLP and provides an efficient way of finding the remaining visible primitives. We do this by adding a second phase to PLP which uses image-space techniques for determining the visibility status of the remaining geometry. Another contribution of our work is to show how to efficiently implement such image-space visibility queries using currently available OpenGL hardware and extensions. We report on the implementation of our techniques on several graphics architectures, analyze their complexity, and discuss a possible hardware extension that has the potential to further increase performance.Keywords
This publication has 22 references indexed in Scilit:
- Fast approximate quantitative visibility for complex scenesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Conservative visibility preprocessing using extended projectionsPublished by Association for Computing Machinery (ACM) ,2000
- Visibility Preprocessing with Occluder Fusion for Urban WalkthroughsPublished by Springer Nature ,2000
- Occluder Shadows for Fast Walkthroughs of Urban EnvironmentsComputer Graphics Forum, 1999
- Occlusion culling with optimized hierarchical bufferingPublished by Association for Computing Machinery (ACM) ,1999
- Decoupling Polygon Rendering from Geometry using Rasterization HardwarePublished by Springer Nature ,1999
- Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded ScenesComputer Graphics Forum, 1998
- Visibility culling using hierarchical occlusion mapsPublished by Association for Computing Machinery (ACM) ,1997
- Visibility preprocessing for interactive walkthroughsACM SIGGRAPH Computer Graphics, 1991
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980