Computing the distance between general convex objects in three-dimensional space
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 6 (1) , 53-61
- https://doi.org/10.1109/70.88117
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A Direct Minimization Approach for Obtaining the Distance between Convex PolyhedraThe International Journal of Robotics Research, 1989
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- A New Iterative Procedure for the Minimization of a Quadratic Form on a Convex SetSIAM Journal on Control, 1970
- An Efficient Computational Procedure for a Generalized Quadratic Programming ProblemSIAM Journal on Control, 1969
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex SetSIAM Journal on Control, 1966