2S Gottschalk M C,Lin D Manocha. OBBTree:A Hierarchical Structure for Rapid Interference Detection[C].In:Proceedings of SIGGRAPH' 96,1996:171～180.
3E G Gilbert,D W Johnson,S S Keerthi.A fast Procedure for computing the distance between complex Objects in Three-Dimensional Space[J].IEEE Journal of Robotics and Automation,1988;4(2):193～203.
4G van den Bergen.A fast and Robust GJK implementation for collision detection for convex objects[J].Journal of Graphics tools, 1997.
5M Lin,J Canny.A fast algorithm for incremental distance calculation[C].In:IEEE Int Conf Robot Automat,Sacramento,CA, 1991:1008～1014.
6Y Sato,M Hirata,T Maruyama et al.Efficient Collision Detection using Fast Distance-Calculation Algorithms for Convex and Non-Convex Objects[C].In:Proceedings for the 1996 IEEE International Conference on Robotics and Automation Minneapolis,Minnesota-April, 1996:771～778.
7S Cameron.Enhancing GJK:Computing minimum and penetration distances between convex pllyhedra[C].In:Proc IEEE Int Conf On Robotics and Automation, 1997: 3112～3117.
8Katsuaki Kawachi, Hiromasa Suzuki. Distance Computation between Non-convex Polyhedra at Short Range Based on Discrete Voronoi Regions[C].In: Geometric Modeling and Processing, Hong Kong, China,2000.
9Stephen Cameron. A Comparison of Two Fast Algorithms for Computing the Distance Between Convex Polyhedra[J].IEEE transactions on robotics and automation, 1997; 13 (6).
