Enhancing GJK: computing minimum and penetration distances between convex polyhedra
暂无分享,去创建一个
[1] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[2] Larry J. Leifer,et al. A Proximity Metric for Continuum Path Planning , 1985, IJCAI.
[3] S. A. Cameron,et al. Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[4] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[5] Elmer G. Gilbert,et al. Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..
[6] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[7] Elmer G. Gilbert,et al. New distances for the separation and penetration of objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[8] S. Cameron,et al. Towards efficient motion planning for manipulators with complex geometry , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.
[9] Dinesh Manocha,et al. Incremental algorithms for collision detection between solid models , 1995, Symposium on Solid Modeling and Applications.
[10] Yuichi Sato,et al. Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[11] Boris Baginski,et al. Local motion planning for manipulators based on shrinking and growing geometry models , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[12] Stephen Cameron,et al. A comparison of two fast algorithms for computing the distance between convex polyhedra , 1997, IEEE Trans. Robotics Autom..