2 search results - page 1 / 1 » Cache-Efficient Layouts of Bounding Volume Hierarchies |
CGF
2006
13 years 4 months ago
2006
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
SIGGRAPH
2009
ACM
13 years 11 months ago
2009
ACM
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 ...