Time and Space Coherent Occlusion Culling for Tileable Extended 3D Worlds

Abstract : In order to interactively render large virtual worlds, the amount of 3D geometry passed to the graphics hardware must be kept to a minimum. Typical solutions to this problem include the use of potentially visible sets and occlusion culling, however, these solutions do not scale well, in time nor in memory, with the size of a virtual world. We propose a fast and inexpensive variant of occlusion culling tailored to a simple tiling scheme that improves scalability while maintaining very high performance. Tile visibilities are evaluated with hardwareaccelerated occlusion queries, and in-tile rendering is rapidly computed using BVH instantiation and any visibility method; we use the CHC++ occlusion culling method for its good general performance. Tiles are instantiated only when tested locally for visibility, thus avoiding the need for a preconstructed global structure for the complete world. Our approach can render large-scale, diversified virtual worlds with complex geometry, such as cities or forests, all at high performance and with a modest memory footprint.
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01147303
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, April 30, 2015 - 10:10:41 AM
Last modification on : Wednesday, April 17, 2019 - 12:15:34 PM
Document(s) archivé(s) le : Monday, September 14, 2015 - 4:11:40 PM

File

Gomez_12815.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01147303, version 1
  • OATAO : 12815

Collections

Citation

Dorian Gomez, Mathias Paulin, David Vanderhaeghe, Pierre Poulin. Time and Space Coherent Occlusion Culling for Tileable Extended 3D Worlds. International Conference on Computer-Aided Design and Computer Graphics (CADGC), Nov 2013, Hong Kong, China. pp. 1-8. ⟨hal-01147303⟩

Share

Metrics

Record views

179

Files downloads

301