Enhancing GJK: computing minimum and penetration distances between convex polyhedra
Top Cited Papers
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 3112-3117
- https://doi.org/10.1109/robot.1997.606761
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Local motion planning for manipulators based on shrinking and growing geometry modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New distances for the separation and penetration of objectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A fast algorithm for incremental distance calculationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- 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 modelsPublished by Association for Computing Machinery (ACM) ,1995
- 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 polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983