Abstract
The tracking of distance between two convex polyhedra is commonly used in the field of robotics, including collision detection or path planning. One of the well-known algorithms in this area is the distance algorithm developed by Gilbert, Johnson and Keerthi. Although this algorithm is widely-used in robotics, up till now, there has been no verification of the computed results. This paper will present an interval version for tracking the distance between convex polyhedra using the C++ library PROFIL/BIAS.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Cameron, Enhancing GJK: Computing minimum and penetration distances between convex polyhedra, in: Proc. of IEEE Internat Conf. on Robotics and Automation, Albuquerque, NM, 1997, pp. 3112–3117.
T.L. Chung, An efficient collision detection algorithm for polytopes in virtual environments, M. Phil. thesis, University of Hong Kong (1996).
J. Cohem, M.C. Lin, D. Manocha and K. Ponamgi, I-COLLIDE: An interactive and exact collision detection system for large-scale environments, in: Proc. of Symposium of Interactive 3D Graphics, 1995, pp. 189–196.
E. Dyllong and W. Luther, An accurate distance-computation algorithm for convex polyhedra, Reliable Comput. 5 (1999) 241–253.
S.A. Ehmann and M.C. Lin, Accurate and fast proximity queries between polyhedra using surface decomposition, in: Proc. of Eurographics, 2001.
E.G. Gilbert, D.W. Johnson and S.S. Keerthi, A fast procedure for computing the distance between complex objects in three-dimensional space, IEEE J. Robotics Automat. 4 (1988) 193–203.
E.G. Gilbert and C.J. Ong, Fast versions of the Gilbert-Johnson-Keethi distance algorithm: Additional results and comparisons, IEEE Trans. Robotics Automat. 17(4) (2001) 531–539.
S.S. Keerthi, S.K. Shevade, C. Bhattacharyya and K.R.K. Murthy, A fast iterative nearest point algorithm for support vector machine classifier design, IEEE Trans. Neural Networks 11(1) (2000) 124–136.
O. Knüppel, PROFIL/BIAS–A fast interval library, Computing 53 (1994) 277–288.
M.C. Lin and J.F. Canny, A fast algorithm for incremental distance calculation, in: Proc. of IEEE Internat. Conf. on Robotics and Automation, Sacramento, CA, 1991, pp. 1008–1014.
B. Mirtich, V-Clip: Fast and robust polyhedral collision detection, ACM Trans. Graphics 17 (1998) 177–208.
R. Rabbitz, Fast collision detection of moving convex polyhedra, in: Graphics Gems IV, ed. P.S. Heckbert (Academic Press, New York, 1994) pp. 83–109.
Y. Sato, M. Hirita, T. Maruyama and Y. Arita, Efficient collision detection for convex and nonconvex objects, in: Proc. of IEEE Internat. Conf. on Robotics and Automation, Minneapolis, MN, 1996, pp. 771–777.
G. van den Bergen, A fast and robust GJK implementation for collision detection of convex objects, J. Graphics Tools 4(2) (1999) 7–25.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dyllong, E., Luther, W. The GJK Distance Algorithm: An Interval Version for Incremental Motions. Numerical Algorithms 37, 127–136 (2004). https://doi.org/10.1023/B:NUMA.0000049460.50984.b8
Issue Date:
DOI: https://doi.org/10.1023/B:NUMA.0000049460.50984.b8