A fast procedure for computing the distance between complex objects in three space
暂无分享,去创建一个
S. Sathiya Keerthi | Elmer G. Gilbert | Daniel W. Johnson | E. Gilbert | S. Keerthi | Daniel W. Johnson
[1] E. Gilbert. An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set , 1966 .
[2] E. Gilbert,et al. Some efficient algorithms for a class of abstract optimization problems arising in optimal control , 1969 .
[3] R. Barr. An Efficient Computational Procedure for a Generalized Quadratic Programming Problem , 1969 .
[4] Philip Wolfe,et al. Finding the nearest point in A polytope , 1976, Math. Program..
[5] John W. Boyse,et al. Interference detection among solids and surfaces , 1979, CACM.
[6] Jacob T. Schwartz,et al. Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.
[7] Francis Y. L. Chin,et al. Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.
[8] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[9] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[10] W. Edward Red,et al. Minimum distances for robot task simulation , 1983, Robotica (Cambridge. Print).
[11] D. T. Lee,et al. Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.
[12] Rodney A. Brooks,et al. A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[13] Bruce Randall Donald,et al. On motion planning with six degrees of freedom: Solving the intersection problems in configuration space , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[14] Herbert Edelsbrunner,et al. Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.
[15] Stephen Cameron,et al. A study of the clash detection problem in robotics , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[16] Elmer G. Gilbert,et al. Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..
[17] Elmer Gilbert,et al. Minimum time robot path planning in the presence of obstacles , 1985, 1985 24th IEEE Conference on Decision and Control.
[18] David G. Kirkpatrick,et al. A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.
[19] Larry J. Leifer,et al. A Proximity Metric for Continuum Path Planning , 1985, IJCAI.
[20] Vladimir J. Lumelsky,et al. On Fast Computation of Distance Between Line Segments , 1985, Information Processing Letters.
[21] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .
[22] S. A. Cameron,et al. Determining the minimum translational distance between two convex polyhedra , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[23] Karl G. Kempf,et al. A collision detection algorithm based on velocity and distance bounds , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[24] Walter Meyer,et al. Distances between boxes: Applications to collision detection and clipping , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[25] John F. Canny,et al. Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.