Optimized HLOD refinement driven by hardware occlusion queries

Authors:
Jean Pierre Charalambos;Jiří Bittner;Michael Wimmer;Eduardo Romero
Affiliations:
Vienna University of Technology and National University of Colombia;Czech Technical University in Prague;Vienna University of Technology;National University of Colombia
Venue:
ISVC'07 Proceedings of the 3rd international conference on Advances in visual computing - Volume Part I
Year:
2007

Citing 9
Cited 1

Digital Image Processing

Digital Image Processing
Integrating occlusion culling with view-dependent rendering

Proceedings of the conference on Visualization '01
Adaptive tetrapuzzles: efficient out-of-core construction and visualization of gigantic multiresolution polygonal models

ACM SIGGRAPH 2004 Papers
Quick-VDR: Interactive View-Dependent Rendering of Massive Models

VIS '04 Proceedings of the conference on Visualization '04
Far voxels: a multiresolution framework for interactive rendering of huge complex 3D models on commodity graphics platforms

ACM SIGGRAPH 2005 Papers
Virtual Multiresolution Screen Space Errors: Hierarchical Level-of-Detail (HLOD) Refinement Through Hardware Occlusion Queries

GMAI '06 Proceedings of the conference on Geometric Modeling and Imaging: New Trends
A survey of visibility for walkthrough applications

IEEE Transactions on Visualization and Computer Graphics
Real-time appearance preserving out-of-core rendering with shadows

EGSR'04 Proceedings of the Fifteenth Eurographics conference on Rendering Techniques
Near optimal hierarchical culling: performance driven use of hardware occlusion queries

EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques

Massive model visualization techniques: course notes

ACM SIGGRAPH 2008 classes

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new method for integrating hierarchical levels of detail (HLOD) with occlusion culling. The algorithm refines the HLOD hierarchy using geometric criteria as well as the occlusion information. For the refinement we use a simple model which takes into account the possible distribution of the visible pixels. The traversal of the HLOD hierarchy is optimized by a new algorithm which uses spatial and temporal coherence of visibility. We predict the HLOD refinement condition for the current frame based on the results from the last frame. This allows an efficient update of the front of termination nodes as well as an efficient scheduling of hardware occlusion queries. Compared to previous approaches, the new method improves on speed as well as image quality. The results indicate that the method is very close to the optimal scheduling of occlussion queries for driving the HLOD refinement.