|
Information
|
- Publication Type: Invited Talk
- Event: 14th Computer Vision Winter Workshop (CVWW2009)
|
|
Abstract
| |
Visibility computation is an essential part of many computer graphics applications, for example for real-time rendering of very large scenes. Visibility can either be precomputed offline, which is a good strategy for static scenes, or calculated at runtime, which avoids precomputation and works well for dynamic scenes. In this presentation, I will cover the latest advances in both of these principal directions. For visibility precomputation, we have shown that sampling is superior to full geometric approaches for practical applications, due to its efficiency and robustness. For online visibility culling, we show how to make the best possible use of hardware occlusion queries without introducing latency and overhead.
|
|
Additional Files and Images
| |
No additional files or images.
|
|
BibTeX
| |
Not available as BibTeX-Entry.
|
|
