A Fast and Robust GJK Implementation for Collision Detection of Convex Objects
暂无分享,去创建一个
[1] David P. Dobkin,et al. The quickhull algorithm for convex hulls , 1996, TOMS.
[2] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[3] Wenping Wang,et al. Quick collision detection of polytopes in virtual environments , 1996, VRST.
[4] Elmer G. Gilbert,et al. Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..
[5] S. A. Cameron,et al. Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[6] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[7] Dinesh Manocha,et al. I-COLLIDE: an interactive and exact collision detection system for large-scale environments , 1995, I3D '95.
[8] Richard J. Rabbitz,et al. Fast Collision Detection of Moving Convex Polyhedra , 1994, Graphics Gems.
[9] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[10] Elmer G. Gilbert,et al. The Gilbert-Johnson-Keerthi distance algorithm: a fast version for incremental motions , 1997, Proceedings of International Conference on Robotics and Automation.