Loading...
Loading...

Go to the content (press return)

Integrating occlusion culling and levels of detail through hardly-visible sets

Author
Andujar, C.; Saona, C.; Navazo, I.; Brunet, P.
Type of activity
Journal article
Journal
Computer graphics forum
Date of publication
2000-12
Volume
19
Number
3
First page
499
Last page
506
DOI
https://doi.org/10.1111/1467-8659.00442 Open in new window
Repository
http://hdl.handle.net/2117/10862 Open in new window
Abstract
Occlusion culling and level-of-detail rendering have become two powerful tools for accelerating the handling of very large models in real-time visualization applications. We present a framework that combines both techniques to improve rendering times. Classical occlusion culling algorithms compute potentially visible sets (PVS), which are supersets of the sets of visible polygons. The novelty of our approach is to estimate the degree of visibility of each object of the PVS using synthesized coar...
Citation
Andujar, C. [et al.]. Integrating occlusion culling and levels of detail through hardly-visible sets. "Computer graphics forum", Desembre 2000, vol. 19, núm. 3, p. 499-506.
Keywords
Data visualisation, Hidden feature removal, Octrees, Real-time systems, Rendering (computer graphics), Set theory
Group of research
ViRVIG - Visualisation, Virtual Reality and Graphic Interaction Research Group

Participants