论文标题
碰撞检测和接近查询的压缩边界量层次结构
Compressed Bounding Volume Hierarchies for Collision Detection & Proximity Query
论文作者
论文摘要
我们提出了一种新颖的表示，用于同时界限体积层次结构（BVH）遍历的新颖表示，例如它们在碰撞检测和接近查询中出现。主要思想是压缩边界卷（BV）描述符，并将BVH聚集到适合CPU缓存的较小部分“ trelet”中，同时保持随机访问和自动缓存感知的数据结构布局。为此，我们根据BVH中的特定节点，基于BVS的链条向上量化了BV并使用预测器方案来量化BV和“ Treelet”。
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.
