RACBVHs: random-accessible compressed bounding volume hierarchies.
We present a novel compressed bounding volume hierarchy (BVH) representation, random-accessible compressed bounding volume hierarchies (RACBVHs), for various applications requiring random access on BVHs of massive models. Our RACBVH representation is compact and transparently supports random access on the compressed BVHs without decompressing the whole BVH. To support random access on our compressed BVHs, we decompose a BVH into a set of clusters. Each cluster contains consecutive bounding volume (BV) nodes in the original layout of the BVH. Also, each cluster is compressed separately from other clusters and serves as an access point to the RACBVH representation. We provide the general BVH access API to transparently access our RACBVH representation. At runtime, our decompression framework is guaranteed to provide correct BV nodes without decompressing the whole BVH. Also, our method is extended to support parallel random access that can utilize the multicore CPU architecture. Our method can achieve up to a 12:1 compression ratio, and more importantly, can decompress 4.2 M BV nodes ({=}135 {\rm MB}) per second by using a single CPU-core. To highlight the benefits of our approach, we apply our method to two different applications: ray tracing and collision detection. We can improve the runtime performance by more than a factor of 4 as compared to using the uncompressed original data. This improvement is a result of the fast decompression performance and reduced data access time by selectively fetching and decompressing small regions of the compressed BVHs requested by applications.
Kim
Tae-Joon
TJ
Korea Advanced Institute of Science and Technology, Daejeon. tjkim@tclab.kaist.ac.kr
Moon
Bochang
B
Kim
Duksu
D
Yoon
Sung-Eui
SE
D000465:Algorithms; D003196:Computer Graphics; D003198:Computer Simulation; D044962:Data Compression / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D008962:Models, Theoretical