Quick elimination of non-interference polytopes in virtual environments

The problem of collision detection is fundamental to interactive applications such as computer animation and virtual environments. In these fields, prompt recognition of possible impacts is important for computing real-time response. However, existing algorithms do not eliminate non-interfence objects efficiently. This paper presents a practical algorithm to quickly eliminate most non-interference convex polyhedra when their bounding boxes overlap. The idea is to search for a proper separating plane between two polyhedra and cache this plane as a witness for the next time step. Temporal and geometric coherences are exploited in this algorithm so that it runs in expected constant time.

[1]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[2]  Ying Yang,et al.  An improved algorithm for collision detection in cloth animation with human body , 1993 .

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

[4]  David Baraff,et al.  Curved surfaces and coherence for non-penetrating rigid body simulation , 1990, SIGGRAPH.

[5]  Alejandro M. García-Alonso,et al.  Solving the collision detection problem , 1994, IEEE Computer Graphics and Applications.

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

[7]  Christian Thiely.  Eecient Collision Detection for Moving Polyhedra , 1995 .

[8]  Dinesh Manocha,et al.  Incremental algorithms for collision detection between solid models , 1995, Symposium on Solid Modeling and Applications.

[9]  Yoshifumi Kitamura,et al.  A simple and efficient method for accurate collision detection among deformable polyhedral objects in arbitrary motion , 1995, Proceedings Virtual Reality Annual International Symposium '95.

[10]  George Vanĕček,et al.  Collision Detection and Analysis in a Physically Based Simulation , 1991 .

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

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

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

[14]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

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

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

[17]  Jane Wilhelms,et al.  Collision Detection and Response for Computer Animation , 1988, SIGGRAPH.

[18]  Vincent Hayward,et al.  The use of awareness in collision prediction , 1990, Proceedings., IEEE International Conference on Robotics and Automation.