The GJK Distance Algorithm: An Interval Version for Incremental Motions
- 1 December 2004
- journal article
- Published by Springer Nature in Numerical Algorithms
- Vol. 37 (1-4) , 127-136
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A fast algorithm for incremental distance calculation2002
- Enhancing GJK: computing minimum and penetration distances between convex polyhedra2002
- Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface DecompositionComputer Graphics Forum, 2001
- Fast versions of the Gilbert-Johnson-Keerthi distance algorithm: additional results and comparisonsIEEE Transactions on Robotics and Automation, 2001
- A fast iterative nearest point algorithm for support vector machine classifier designIEEE Transactions on Neural Networks, 2000
- An Accurate Distance-Calculation Algorithm for Convex PolyhedraReliable Computing, 1999
- A Fast and Robust GJK Implementation for Collision Detection of Convex ObjectsJournal of Graphics Tools, 1999
- PROFIL/BIAS—A fast interval libraryComputing, 1994
- Fast Collision Detection of Moving Convex Polyhedra1994
- A fast procedure for computing the distance between complex objects in three-dimensional spaceIEEE Journal on Robotics and Automation, 1988