Enhancing GJK: computing minimum and penetration distances between convex polyhedra
Author:
- S. CameronSCS. Cameron
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 3112-3117
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Local motion planning for manipulators based on shrinking and growing geometry models2002
- Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects2002
- New distances for the separation and penetration of objects2002
- A fast algorithm for incremental distance calculation2002
- A comparison of two fast algorithms for computing the distance between convex polyhedraIEEE Transactions on Robotics and Automation, 1997
- Incremental algorithms for collision detection between solid models1995
- Computing the distance between general convex objects in three-dimensional spaceIEEE Transactions on Robotics and Automation, 1990
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988
- Determining the minimum translational distance between two convex polyhedra1986
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983