A Model for the Expected Running Time of Collision Detection using AABB Trees


In this paper, we propose a model to estimate the expected running time of hierarchical collision detection that utilizes AABB trees, which are a frequently used type of bounding volume (BV). We show that the average running time for the simultaneous traversal of two binary AABB trees depends on two characteristic parameters: the overlap of the root BVs… (More)
DOI: 10.2312/EGVE/EGVE06/011-017
View Slides


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics