ADB-Trees: Controlling the Error of Time-Critical Collision Detection

Jan Klein, Gabriel Zachmann · 2003

We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality for speed. Our algorithm yields an estimation of the quality, so that applications can specify the desired quality. In a timecritical system, applications can specify the maximum time budget instead, and quantitatively assess the quality of the results returned by the collision detection afterwards. Our framework

Read the paper · More papers on PaperTik