A model for the expected running time of collision detection using AABBs 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 and the BV diminishing factor within the hierarchies. With this model, we show that the average running time is in O(n) or even in O(logn) for realistic cases. Finally, we present some experiments that confirm our theoretical considerations. We believe that our results are interesting not only from a theoretical point of view, but also for practical applications, e. g., in time-critical collision detection scenarios where our running time prediction could help to make the best use of CPU time available.

[1]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[2]  Doug L. James,et al.  BD-tree: output-sensitive collision detection for reduced deformable models , 2004, SIGGRAPH 2004.

[3]  Dinesh K. Pai,et al.  BD-tree: output-sensitive collision detection for reduced deformable models , 2004, ACM Trans. Graph..

[4]  Subhash Suri,et al.  Collision detection in aspect and scale bounded polyhedra , 1998, SODA '98.

[5]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[6]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[7]  Donald P. Greenberg,et al.  Improved Computational Methods for Ray Tracing , 1984, TOGS.

[8]  Gabriel Zachmann,et al.  Minimal hierarchical collision detection , 2002, VRST '02.

[9]  Richard L. Grimsdale,et al.  Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.

[10]  Gabriel Zachmann,et al.  Time-critical collision detection using an average-case approach , 2003, VRST '03.

[11]  Dinesh Manocha,et al.  Rapid and Accurate Contact Determination between Spline Models using ShellTrees , 1998, Comput. Graph. Forum.

[12]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[13]  Tomas Akenine-Möller,et al.  Collision Detection for Continuously Deforming Bodies , 2001, Eurographics.

[14]  Elmar Schömer,et al.  Efficient collision detection for moving polyhedra , 1995, SCG '95.

[15]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[16]  Elmar Schömer,et al.  Subquadratic algorithms for the general collision detection problem , 1995 .

[17]  Joachim Gudmundsson,et al.  Box-Trees and R-Trees with Near-Optimal Query Time , 2001, SCG '01.

[18]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[19]  Subhash Suri,et al.  Analysis of a bounding box heuristic for object intersection , 1999, SODA '99.

[20]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[21]  Baba C. Vemuri,et al.  Fast Collision Detection Algorithms with Applications to Particle Flow , 1998, Comput. Graph. Forum.

[22]  Taosong He,et al.  Fast collision detection using QuOSPO trees , 1999, SI3D.

[23]  Ming C. Lin,et al.  A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.