A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Bandwidth-Efficient BVH Layout for Incremental Hardware Traversal
[article]
2016
High Performance Graphics
The memory footprint of bounding volume hierarchies (BVHs) can be significantly reduced using incremental encoding, which enables the coarse quantization of bounding volumes. However, this compression alone does not necessarily yield a comparable improvement in memory bandwidth. While the bounding volumes of the BVH nodes can be aggressively quantized, the size of the child node pointers remains a significant overhead. Moreover, as BVH nodes become comparably small to practical cache line
doi:10.2312/hpg.20161192
dblp:conf/egh/LiktorV16
fatcat:cycbsqkx3jdl5acedlvgwrm6ze