CG Research Projects

Research > Projects > Collision Detection

We developed an efficient collision detection algorithm for convex polytopes, which quickly finds a separating plane (based on a separating vector) between two polytopes if they are non-colliding. Both temporal and geometric coherences are exploited to speed up the algorithm in dynamic applications.
 

Software

Q-COLLIDE: Quick Collision Detection Library

Publications

Quick Elimination of Non-Interference Polytopes in Virtual Environments
Kelvin Chung and Wenping Wang.  
The 3rd European Workshop on Virtual Environments , 19-20, Feb, 96, Monte Carlo, Monaco. Also appear in the book Virtual Environments '96 , Springer-Verlag Wien New York, 1996.

Full paper (pdf 555 KB)

Quick Collision Detection of Polytopes in Virtual Environments.
Kelvin Chung and Wenping Wang. 
ACM Symposium on Virtual Reality Software and Technology 1996 , 1-4, July, 96, University of Hong Kong, Hong Kong.

Full paper (pdf 612 KB)

An Efficient Collision Detection Algorithm for Polytopes in Virtual Environments.
Kelvin Chung.
MPhil Thesis , Department of Computer Science, University of Hong Kong, September 1996.

Thesis (pdf 1.02 MB)

Detecting Collision of Polytopes Using a Heuristic Search for Separating Vectors.
Xueqing Li, Xiangxu Meng, C.Y. Wang, Wenping Wang, Kelvin Chung and Siu Ming Yiu.