| dc.contributor.author | Benthin, Carsten | en_US |
| dc.contributor.author | Wald, Ingo | en_US |
| dc.contributor.author | Woop, Sven | en_US |
| dc.contributor.author | Áfra, Attila T. | en_US |
| dc.contributor.editor | Patney, Anjul and Niessner, Matthias | en_US |
| dc.date.accessioned | 2018-11-11T10:46:00Z | |
| dc.date.available | 2018-11-11T10:46:00Z | |
| dc.date.issued | 2018 | |
| dc.identifier.isbn | 978-1-4503-5896-5 | |
| dc.identifier.issn | 2079-8679 | |
| dc.identifier.uri | https://doi.org/10.1145/3231578.3231581 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1145/3231578-3231581 | |
| dc.description.abstract | We propose and evaluate what we call Compressed-Leaf Bounding Volume Hierarchies (CLBVH), which strike a balance between compressed and non-compressed BVH layouts. Our CLBVH layout introduces dedicated compressed multi-leaf nodes where most effective at reducing memory use, and uses regular BVH nodes for inner nodes and small, isolated leaves. We show that when implemented within the Embree ray tracing framework, this approach achieves roughly the same memory savings as Embree's compressed BVH layout, while maintaining almost the full performance of its fastest non-compressed BVH. | en_US |
| dc.publisher | ACM | en_US |
| dc.subject | Computing methodologies | |
| dc.subject | Ray tracing | |
| dc.subject | ray tracing | |
| dc.subject | bounding volume hierarchy | |
| dc.subject | compression | |
| dc.title | Compressed-Leaf Bounding Volume Hierarchies | en_US |
| dc.description.seriesinformation | Eurographics/ ACM SIGGRAPH Symposium on High Performance Graphics | |
| dc.description.sectionheaders | Ray Traversal, Transparency, and GPU Computing | |
| dc.identifier.doi | 10.1145/3231578.3231581 | |
