Collision detection with relative screw motion

We introduce a framework for collision detection between a pair of rigid polyhedra. Given the initial and final positions and orientations of two objects, the algorithm determines whether they collide, and if so, when and where. All collisions, including collisions at different times, are computed at once along with “properness” values that measure the extent to which the collisions are between parts of the objects that properly face each other. This is useful for handling multiple (nearly) concurrent collisions and contact points.The relative motions of the rigid bodies are limited to screw motions. This limitation is not always completely accurate, but we can estimate the error introduced by the assumption.Our implementation uses rasterization to approximate the position and time of the collisions. This allows level-of-detail techniques that provide a tradeoff between accuracy and computational expense.The collision detection algorithms are only approximate, both because of the screw motion assumption and because of the rasterization. However, they can be made robust so as to give consistent information about collisions and to avoid sensitivity to roundoff errors.

[1]  Jarek Rossignac,et al.  Collision prediction for polyhedra under screw motions , 2003, SM '03.

[2]  Stephen Cameron,et al.  Collision detection by four-dimensional intersection testing , 1990, IEEE Trans. Robotics Autom..

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

[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]  Alan H. Barr,et al.  Geometric collisions for time-dependent parametric surfaces , 1990, SIGGRAPH.

[6]  Ming C. Lin,et al.  Efficient collision detection for animation and robotics , 1993 .

[7]  R BussSamuel.  Collision detection with relative screw motion , 2005 .

[8]  Elmar Schömer,et al.  A FRAMEWORK FOR COLLISION DETECTION AND RESPONSE , 1999 .

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

[10]  David G. Kirkpatrick,et al.  Determining the Separation of Preprocessed Polyhedra - A Unified Approach , 1990, ICALP.

[11]  George Baciu,et al.  Image-Based Techniques in a Hybrid Collision Detector , 2003, IEEE Trans. Vis. Comput. Graph..

[12]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[13]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1975, AFIPS '75.

[14]  A. Ruina,et al.  A New Algebraic Rigid-Body Collision Law Based on Impulse Space Considerations , 1998 .

[15]  Abderrahmane Kheddar,et al.  CONTACT: arbitrary in-between motions for collision detection , 2001, Proceedings 10th IEEE International Workshop on Robot and Human Interactive Communication. ROMAN 2001 (Cat. No.01TH8591).

[16]  Karol Myszkowski,et al.  Fast collision detection between complex solids using rasterizing graphics hardware , 1995, The Visual Computer.

[17]  Philip M. Hubbard,et al.  Collision Detection for Interactive Graphics Applications , 1995, IEEE Trans. Vis. Comput. Graph..

[18]  Abderrahmane Kheddar,et al.  An algebraic solution to the problem of collision detection for rigid polyhedral objects , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[19]  J. W. Humberston.  Classical mechanics , 1980, Nature.

[20]  Abderrahmane Kheddar,et al.  Hierarchical back-face culling for collision detection , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[22]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[23]  Jarek Rossignac,et al.  Computing and visualizing pose-interpolating 3D motions , 2001, Comput. Aided Des..

[24]  Mikio Shinya,et al.  Interference detection through rasterization , 1991, Comput. Animat. Virtual Worlds.

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

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

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

[28]  Stanley W. Shepperd,et al.  Quaternion from Rotation Matrix , 1978 .

[29]  Janusz,et al.  Geometrical Methods in Robotics , 1996, Monographs in Computer Science.

[30]  Bruce G. Baumgart.  A polyhedron representation for computer vision , 1899 .

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

[32]  John M. Snyder,et al.  Interval methods for multi-point collisions between time-dependent curved surfaces , 1993, SIGGRAPH.

[33]  Stephen Cameron,et al.  A study of the clash detection problem in robotics , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[34]  Bettina Speckmann,et al.  Kinetic collision detection for simple polygons , 2000, SCG '00.

[35]  Dinesh Manocha,et al.  Fast penetration depth computation for physically-based animation , 2002, SCA '02.

[36]  Ken Shoemake,et al.  Animating rotation with quaternion curves , 1985, SIGGRAPH.

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

[38]  Dinesh Manocha,et al.  CULLIDE: interactive collision detection between complex models in large environments using graphics hardware , 2003, HWWS '03.

[39]  George Vanekckek.  Back-face culling applied to collision detection of polyhedra , 1994, Comput. Animat. Virtual Worlds.

[40]  John W. Boyse,et al.  Interference detection among solids and surfaces , 1979, CACM.

[41]  David Baraff,et al.  Fast contact force computation for nonpenetrating rigid bodies , 1994, SIGGRAPH.

[42]  E. Rosado,et al.  ABSTRACT , 1990 .

[43]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[44]  Dinesh Manocha,et al.  DEEP: dual-space expansion for estimating penetration depth between convex polytopes , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[45]  Leonidas J. Guibas,et al.  Separation-sensitive collision detection for convex objects , 1998, SODA '99.

[46]  William K. Durfee,et al.  IEEE/RSJ/GI International Conference on Intelligent Robots and Systems , 1994 .

[47]  Carol O'Sullivan,et al.  Complementarity based multiple point collision resolution , 2003 .

[48]  Jarek Rossignac,et al.  Interactive inspection of solids: cross-sections and interferences , 1992, SIGGRAPH.

[49]  Leonidas J. Guibas,et al.  Penetration Depth of Two Convex Polytopes in 3D , 2000, Nord. J. Comput..

[50]  Dinesh K. Pai,et al.  CInDeR: Collision and Interference Detection in Real-time using graphics hardware , 2003, Graphics Interface.

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

[52]  Pat Hanrahan,et al.  Ray tracing on a connection machine , 1988, ICS '88.

[53]  Abderrahmane Kheddar,et al.  Gauss' least constraints principle and rigid body simulations , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[54]  David G. Kirkpatrick,et al.  Computing the intersection-depth of polyhedra , 1993, Algorithmica.

[55]  Bruce Randall Donald,et al.  Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.

[56]  Brian Mirtich,et al.  Timewarp rigid body simulation , 2000, SIGGRAPH.

[57]  Bettina Speckmann,et al.  Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons , 2002, SCG '02.