V-Clip: fast and robust polyhedral collision detection

This article presents the Voronoi-clip, or V-Clip, collision detection alogrithm for polyhedral objects specified by a boundary representation. V-Clip tracks the closest pair of features between convex polyhedra, using an approach reminiscent of the Lin-Canny closest features algorithm. V-Clip is an improvement over the latter in several respects. Coding complexity is reduced, and robustness is significantly improved; the implementation has no numerical tolerances and does not exhibit cycling problems. The algorithm also handles penetrating polyhedra, and can therefore be used to detect collisions between nonvconvex polyhedra described as hierarchies of convex pieces. The article presents the theoretical principles of V-Clip, and gives a pseudocode description of the algorithm. It also documents various test that compare V-Clip, Lin-Canny, and the Enhanced GJK algorithm, a simplex-based algorithm that is widely used for the same application. The results show V-Clip to be a strong contender in this field, comparing favorably with the other algorithms in most of the tests, in term of both performance and robustness.

[1]  Pere Brunet,et al.  Object representation by means of nonminimal division quadtrees and octrees , 1985, TOGS.

[2]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

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

[4]  D. Bara.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990 .

[5]  Yoshio Ohno,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[6]  Andrew P. Witkin,et al.  Dynamic simulation of non-penetrating flexible bodies , 1992, SIGGRAPH.

[7]  James C. Miller,et al.  Computer graphics principles and practice, second edition , 1992, Comput. Graph..

[8]  Bruce F. Naylor,et al.  Interactive solid geometry via partitioning trees , 1992 .

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

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

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

[12]  Richard J. Rabbitz,et al.  Fast Collision Detection of Moving Convex Polyhedra , 1994, Graphics Gems.

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

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

[15]  鍾達良.  An efficient collision detection algorithm for polytopes in virtual environments , 1996 .

[16]  Brian Mirtich,et al.  Impulse-based dynamic simulation of rigid body systems , 1996 .

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

[18]  Dinesh Manocha,et al.  V-COLLIDE: accelerated collision detection for VRML , 1997, VRML '97.

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