A comparison of two fast algorithms for computing the distance between convex polyhedra
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 13 (6) , 915-920
- https://doi.org/10.1109/70.650170
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Efficient collision detection using fast distance-calculation algorithms for convex and non-convex 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
- Enhancing GJK: computing minimum and penetration distances between convex polyhedraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- I-COLLIDEPublished 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