Exploiting coherence in hierarchical visibility algorithms
- 1 December 2001
- journal article
- research article
- Published by Wiley in The Journal of Visualization and Computer Animation
- Vol. 12 (5) , 277-286
- https://doi.org/10.1002/vis.269
Abstract
We present a series of simple improvements that make use of temporal and spatial coherence in the scope of hierarchical visibility algorithms. The hierarchy updating avoids visibility tests of certain interior nodes of the hierarchy. The visibility propagation algorithm reuses information about visibility of neighbouring spatial regions. Finally, the conservative hierarchy updating avoids visibility tests of the hierarchy nodes that are expected to remain visible. We evaluate the presented methods in the context of hierarchical visibility culling using occlusion trees. Copyright © 2002 John Wiley & Sons, Ltd.Keywords
This publication has 9 references indexed in Scilit:
- View volume culling using a probabilistic caching schemePublished by Association for Computing Machinery (ACM) ,1997
- Accelerated occlusion culling using shadow frustaPublished by Association for Computing Machinery (ACM) ,1997
- Visibility culling using hierarchical occlusion mapsPublished by Association for Computing Machinery (ACM) ,1997
- Real-time occlusion culling for models with large occludersPublished by Association for Computing Machinery (ACM) ,1997
- Hierarchical polygon tiling with coverage masksPublished by Association for Computing Machinery (ACM) ,1996
- Temporally coherent conservative visibility (extended abstract)Published by Association for Computing Machinery (ACM) ,1996
- IRIS performerPublished by Association for Computing Machinery (ACM) ,1994
- Hierarchical Z-buffer visibilityPublished by Association for Computing Machinery (ACM) ,1993
- On visible surface generation by a priori tree structuresACM SIGGRAPH Computer Graphics, 1980