Hierarchical Raster Occlusion Culling
| dc.contributor.author | Lee, Gi Beom | en_US |
| dc.contributor.author | Jeong, Moonsoo | en_US |
| dc.contributor.author | Seok, Yechan | en_US |
| dc.contributor.author | Lee, Sungkil | en_US |
| dc.contributor.editor | Mitra, Niloy and Viola, Ivan | en_US |
| dc.date.accessioned | 2021-04-09T08:01:43Z | |
| dc.date.available | 2021-04-09T08:01:43Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | This paper presents a scalable online occlusion culling algorithm, which significantly improves the previous raster occlusion culling using object-level bounding volume hierarchy. Given occluders found with temporal coherence, we find and rasterize coarse groups of potential occludees in the hierarchy. Within the rasterized bounds, per-pixel ray casting tests fine-grained visibilities of every individual occludees. We further propose acceleration techniques including the read-back of counters for tightly-packed multidrawing and occluder filtering. Our solution requires only constant draw calls for batch occlusion tests, while avoiding costly iteration for hierarchy traversal. Our experiments prove our solution outperforms the existing solutions in terms of scalability, culling efficiency, and occlusion-query performance. | en_US |
| dc.description.number | 2 | |
| dc.description.sectionheaders | Data Structures | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 40 | |
| dc.identifier.doi | 10.1111/cgf.142649 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 489-495 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.142649 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf142649 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | Computing methodologies | |
| dc.subject | Rasterization | |
| dc.subject | Visibility | |
| dc.title | Hierarchical Raster Occlusion Culling | en_US |