A framework for benchmarking interactive collision detection

Collision detection is a vital component of applications spanning myriad fields, yet there exists no means for developers to analyse the suitability of their collision detection algorithms across the spectrum of scenarios that could be encountered. To rectify this, we propose a framework for benchmarking interactive collision detection, which consists of a single generic benchmark that can be adapted using a number of parameters to create a large range of practical benchmarks. This framework allows algorithm developers to test the validity of their algorithms across a wide test space and allows developers of interactive applications to recreate their application scenarios and quickly determine the most amenable algorithm. To demonstrate the utility of our framework, we adapted it to work with three collision detection algorithms supplied with the Bullet Physics SDK. Our results demonstrate that those algorithms conventionally believed to offer the best performance are not always the correct choice. This demonstrates that conventional wisdom cannot be relied on for selecting a collision detection algorithm and that our benchmarking framework fulfils a vital need in the collision detection community. The framework has been made open source, so that developers do not have to reprogram the framework to test their own algorithms, allowing for consistent results across different algorithms and reducing development time.

[1]  Brian Mirtich,et al.  V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.

[2]  B. J. Epstein.  List of Tables xi , 2012 .

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

[4]  Carla Maria Dal Sasso Freitas,et al.  Broad-phase collision detection using semi-adjusting BSP-trees , 2005, I3D '05.

[5]  Eric Hoines,et al.  A Proposal for Standard Graphics Environments , 1987, IEEE Computer Graphics and Applications.

[6]  Philip M. Hubbard,et al.  Interactive collision detection , 1993, Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium.

[7]  Brian Mirtich,et al.  Efficient Algorithms for Two-Phase Collision Detection , 1997 .

[8]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[9]  Dinesh Manocha,et al.  Collision and Proximity Queries , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

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

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

[12]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[13]  Thomas M. Krummel,et al.  Development of real-time virtual reality haptic application: real-time issues , 1999, Proceedings 12th IEEE Symposium on Computer-Based Medical Systems (Cat. No.99CB36365).

[14]  Abderrahmane Kheddar,et al.  Fast Continuous Collision Detection between Rigid Bodies , 2002, Comput. Graph. Forum.

[15]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[16]  Elmer G. Gilbert,et al.  Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..

[17]  Markus H. Gross,et al.  Optimized Spatial Hashing for Collision Detection of Deformable Objects , 2003, VMV.

[18]  Xiao Rui Cao,et al.  A FRAMEWORK FOR BENCHMARKING HAPTIC SYSTEMS , 2006 .

[19]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..

[20]  Dinesh Manocha,et al.  Fast continuous collision detection for articulated models , 2004, SM '04.

[21]  Stefano Caselli,et al.  Exploiting Advanced Collision Detection Libraries in a Probabilistic Motion Planner , 2002, WSCG.

[22]  Sean Quinlan,et al.  Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[23]  Gabriel Zachmann,et al.  Collision Detection for Deformable Objects , 2004, Comput. Graph. Forum.

[24]  Ming C. Lin,et al.  Collision Detection between Geometric Models: A Survey , 1998 .

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

[26]  Tomas Akenine-Möller,et al.  A Benchmark for Animated Ray Tracing , 2001, IEEE Computer Graphics and Applications.

[27]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[28]  Dinesh Manocha,et al.  I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.

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

[30]  René Weller.  A Benchmarking Suite for Static Collision Detection Algorithms , 2007 .

[31]  Marc Levoy,et al.  Fitting smooth surfaces to dense polygon meshes , 1996, SIGGRAPH.

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

[33]  Ming C. Lin,et al.  Interactive collision detection between deformable models using chromatic decomposition , 2005, ACM Trans. Graph..

[34]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[35]  D. Baraff.  Dynamic simulation of nonpenetrating rigid bodies , 1992 .

[36]  Dinesh Manocha,et al.  Interactive collision detection between deformable models using chromatic decomposition , 2005, SIGGRAPH 2005.

[37]  David Baraff,et al.  Dynamic Simulation of Non-penetrating Rigid Bodies , 1992 .