RACBVHs: random-accessible compressed bounding volume hierarchies

We present a novel bounding volume hierarchy (BVH) compression and decompression method transparently supporting random access on the compressed BVHs. To support random access on the compressed BVHs, we decompose a BVH into a set of clusters, each of which contains consecutive bounding volume (BV) nodes in the original layout of the BVH. Then, each cluster is compressed separately from other clusters and serves as an access point to the compressed BVH. Our compression method preserves the original layout of a BVH. If BVHs are provided with cache-efficient layouts, we can maintain high cache utilization during random access or hierarchical access on the compressed BVH. We provide the general BVH access API to transparently access the compressed BVHs. At runtime, our decompression framework guarantees to provide correct BV nodes requested by applications without loading and decompressing the whole BVHs. To highlight the benefits of our approach, we apply our method to two different ap...

• Type: Conference
• Year: 2009
• Where: SIGGRAPH
• Authors: Tae-Joon Kim, Bochang Moon, Duksu Kim, Sung-Eui Yoon
• Keywords: Bounding Volume, Bvh Access Api, Computer Graphics, Random Access, SIGGRAPH 2009