An algebraic solution to the problem of collision detection for rigid polyhedral objects

This paper describes a new collision detection algorithm designed for interactive manipulation in virtual environments. Making some assumptions on object motion, the collision time between two objects can be computed by solving a polynomial equation whose degree is equal to or smaller than three.

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

[2]  M HubbardPhilip.  Collision Detection for Interactive Graphics Applications , 1995 .

[3]  Yoshifumi Kitamura,et al.  A Sophisticated Manipulation Aid in a Virtual Environment using Dynamic Constraints among Object Faces , 1998, Presence.

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

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

[6]  Elmer G. Gilbert,et al.  A new algorithm for detecting the collision of moving objects , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

[8]  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.

[9]  John C. Platt,et al.  Elastically deformable models , 1987, SIGGRAPH.