A Comparative Study of Implemented Collision Detection Strategies

Many computer interactive environments require to calculate collision detections between geometrical models, usually triangle meshes. In this paper, a comparative study of some collision detection strategies is realized. For this purpose, the compared algorithms have been implemented. Some of these algorithms also allow realizing other procedures, such as calculating distances or overlapping triangles. Hence, the main features of each algorithm have been explained. The compared strategies have been tested considering, in addition to the runtime, the pre-processing time and the memory usage. Finally, the results have been compared in order to extract the benefits and constraints of each strategy, and proposing some possible applications for

[1]  Juan José Jiménez-Delgado,et al.  Particle Oriented Collision Detection using Simplicial Coverings and Tetra‐Trees , 2006, Comput. Graph. Forum.

[2]  Juan José Jiménez-Delgado,et al.  Collision detection between complex polyhedra , 2008, Comput. Graph..

[3]  P. J. Narayanan,et al.  Fast Two Dimensional Convex Hull on the GPU , 2011, 2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications.

[4]  Ming C. Lin,et al.  Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[5]  M. Levas.  OBBTree : A Hierarchical Structure for Rapid Interference Detection , .

[6]  Juan José Jiménez-Delgado,et al.  Tetra-trees properties in graphic interaction , 2011, Graph. Model..

[7]  Juan José Jiménez-Delgado,et al.  Diseño de descomposiciones espaciales jerárquicas para mallas de triángulos utilizando Geometry Shaders , 2009, CEIG.

[8]  Dinesh Manocha,et al.  Fast Proximity Queries with Swept Sphere Volumes , 1999 .

[9]  Francisco R. Feito-Higueruela,et al.  Inclusion test for general polyhedra , 1997, Comput. Graph..

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

[11]  Bernhard Geiger.  Real-time collision detection and response for complex environments , 2000, Proceedings Computer Graphics International 2000.

[12]  Stephen Cameron,et al.  Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.

[13]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three space , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[14]  Ming C. Lin,et al.  Haptic Rendering : Foundations, Algorithms, and Applications , 2008 .

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

[16]  Thomas S. Huang,et al.  A survey of construction and manipulation of octrees , 1988, Comput. Vis. Graph. Image Process..

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