Hierarchical Z-buffer visibility
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Temporally coherent conservative visibility (extended abstract)
Proceedings of the twelfth annual symposium on Computational geometry
Visibility culling using hierarchical occlusion maps
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Image-based modeling and lighting
ACM SIGGRAPH Computer Graphics
Jupiter: a toolkit for interactive large model visualization
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Efficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm
IEEE Transactions on Visualization and Computer Graphics
A survey of visibility for walkthrough applications
IEEE Transactions on Visualization and Computer Graphics
Occlusion-driven scene sorting for efficient culling
AFRIGRAPH '06 Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Visualization in Medicine: Theory, Algorithms, and Applications
Visualization in Medicine: Theory, Algorithms, and Applications
Visualizing Whole-Brain DTI Tractography with GPU-based Tuboids and LoD Management
IEEE Transactions on Visualization and Computer Graphics
Hair self shadowing and transparency depth ordering using occupancy maps
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Granular visibility queries on the GPU
Proceedings of the 2009 symposium on Interactive 3D graphics and games
Beyond programmable shading (parts I and II)
ACM SIGGRAPH 2009 Courses
| Hi-index | 0.00 |
Image space occlusion culling is an useful approach to reduce the rendering load of large polygonal models. Like most large model techniques, it trades overhead costs with the rendering costs of the possibly occluded geometry. Meanwhile, modern graphics hardware supports occlusion culling, whereas they associate a significant query overhead, which hurts in particular, if the occlusion culling query itself was unsuccessful. In this paper, we propose the Occupancy Map - a compact, cache-optimized representation of coverage information - to reduce the number of costly but unsuccessful occlusion culling queries and to arrange multiple occlusion queries. The information of the Occupancy Map is used to skip an occlusion query, if the respective map area is not yet set - the respective area has not yet received rendered pixels -, hence an occlusion query would always return not occluded. The remaining occlusion information is efficiently determined by asynchronous multiple occlusion queries with hardware-supported query functionality. To avoid redundant results, we arrange these multiple occlusion queries according to the information of several Occupancy Maps. Our presented technique is conservative and benefits from a partial depth order of the geometry.