A fast procedure for computing the distance between complex objects in three-dimensional space
- 1 April 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Robotics and Automation
- Vol. 4 (2), 193-203
- https://doi.org/10.1109/56.2083
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- On motion planning with six degrees of freedom: Solving the intersection problems in configuration spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A fast procedure for computing the distance between complex objects in three spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- A collision detection algorithm based on velocity and distance boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Minimum time robot path planning in the presence of obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- Computing the extreme distances between two convex polygonsJournal of Algorithms, 1985
- Distance functions and their application to robot path planning in the presence of obstaclesIEEE Journal on Robotics and Automation, 1985
- On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriersCommunications on Pure and Applied Mathematics, 1983
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex SetSIAM Journal on Control, 1966