Name
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 Embreeu0027s compressed BVH layout, while maintaining almost the full performance of its fastest non-compressed BVH. |
Year | Venue | Field |
|---|---|---|
2018 | High Performance Graphics | Bounding volume hierarchy,Computing Methodologies,Bounding volume,Ray tracing (graphics),Computer science,Parallel computing,Hierarchy |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carsten Benthin | 1 | 565 | 43.97 |
| Ingo Wald | 2 | 2144 | 171.30 |
| Sven Woop | 3 | 370 | 23.67 |
| Attila T. Áfra | 4 | 32 | 3.69 |