Dynamic Bounding Volume Hierarchies for Occlusion Culling
| dc.contributor.author | Kovalcík, Vít | en_US |
| dc.contributor.author | Tobola, Petr | en_US |
| dc.contributor.editor | Erik Kjems and Roland Blach | en_US |
| dc.date.accessioned | 2014-01-27T10:42:42Z | |
| dc.date.available | 2014-01-27T10:42:42Z | |
| dc.date.issued | 2005 | en_US |
| dc.description.abstract | We present an algorithm for rendering complex scenes using occlusion queries to resolve visibility. To organize objects in the scene, the algorithm uses a ternary tree which is dynamically modified according to the current view and positions of the objects in the scene. Aside from using heuristic techniques to estimate unnecessary queries, the algorithm uses several new features to estimate the set of visible objects more precisely while still retaining the conservativeness. The algorithm is suitable for both static and dynamic scenes with huge number of moving objects. | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Virtual Environments | en_US |
| dc.identifier.isbn | 978-3-905674-06-4 | en_US |
| dc.identifier.issn | 1727-530X | en_US |
| dc.identifier.uri | https://doi.org/10.2312/EGVE/IPT_EGVE2005/091-096 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Hidden surface removal | en_US |
| dc.title | Dynamic Bounding Volume Hierarchies for Occlusion Culling | en_US |
Files
Original bundle
1 - 1 of 1