| Autor: |
Tan, Toni, Weller, Rene, Zachmann, Gabriel |
| Rok vydání: |
2020 |
| Předmět: |
|
| Druh dokumentu: |
Working Paper |
| Popis: |
We present a novel representation of compressed data structure for simultaneous bounding volume hierarchy (BVH) traversals like they appear for instance in collision detection & proximity query. The main idea is to compress bounding volume (BV) descriptors and cluster BVH into a smaller parts 'treelet' that fit into CPU cache while at the same time maintain random-access and automatic cache-aware data structure layouts. To do that, we quantify BV and compress 'treelet' using predictor-corrector scheme with the predictor at a specific node in the BVH based on the chain of BVs upwards. |
| Databáze: |
arXiv |
| Externí odkaz: |
|
