arXiv Open Access 2020

Compressed Bounding Volume Hierarchies for Collision Detection & Proximity Query

Toni Tan Rene Weller Gabriel Zachmann

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.GR

Penulis (3)

Toni Tan

Rene Weller

Gabriel Zachmann

Format Sitasi

APA MLA BibTeX

Tan, T., Weller, R., Zachmann, G. (2020). Compressed Bounding Volume Hierarchies for Collision Detection & Proximity Query. https://arxiv.org/abs/2012.05348

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2020
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓