Computation of penetration between smooth convex objects in three‐dimensional space
暂无分享,去创建一个
[1] 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.
[2] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[3] K Sridharan,et al. Measures of intensity of collision between convex objects and their efficient computation , 1991 .
[4] S. A. Cameron,et al. Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[5] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[6] Charles E. Buckley,et al. A Foundation for the "Flexible-Trajectory" Approach to Numeric Path Planning , 1987, Int. J. Robotics Res..
[7] Stephen P. Boyd,et al. Efficient distance computation using best ellipsoid fit , 1992, Proceedings of the 1992 IEEE International Symposium on Intelligent Control.
[8] Elmer G. Gilbert,et al. Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..
[9] Elmer G. Gilbert,et al. Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..
[10] S. Sathiya Keerthi,et al. Computation of certain measures of proximity between convex polytopes: a complexity viewpoint , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[11] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[12] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..