TY  - JOUR
PY  - 2006//
TI  - Algorithm Research for Computing the Minimum Distance Between Two Convex Polyhedra in Collision Detection
JO  - Journal of Wuhan University of Technology (Transportation Science and Engineering)
A1  - Jin, Hua
A1  - Li, Zhixia
A1  - Wang, Yanfu
A1  - Wang, Qidong
SP  - 300
EP  - 302
VL  - 30
IS  - 2
N2  - An algorithm for computing the minimum distance between two convex polyhedra is presented. The algorithm is applied to polyhedral objects which can be represented as convex hulls of its value of vertices in three-dimensional space. Nonlinear programming techniques are then employed to computer the minimum distance between two convex polyhedra, and according to the minimum distance, it can be concluded whether or not the objects will collide. The algorithm of collision detecting presented in this paper improves the efficiency of vessel collision detecting by simulation experiences.     <p></p>
LA  - 
SN  - 1006-2823
UR  - http://dx.doi.org/
ID  - ref1
ER  -