The GJK distance algorithm: An interval version for incremental motions

Numerical Algorithms

Volumn 37, Issue 1-4 SPEC. ISS., 2004, Pages 127-136

  Dyllong, Eva ^a   Luther, Wolfram ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

convex polyhedra; distance computing; GJK algorithm; interval arithmetic; result verification

Indexed keywords

EID: 10044262331     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:NUMA.0000049460.50984.b8     Document Type: Conference Paper

References (14)

1. 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.
2. T.L. Chung, An efficient collision detection algorithm for polytopes in virtual environments, M. Phil. thesis, University of Hong Kong (1996).
3. 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.
4. E. Dyllong and W. Luther, An accurate distance-computation algorithm for convex polyhedra, Reliable Comput. 5 (1999) 241-253.
5. S.A. Ehmann and M.C. Lin, Accurate and fast proximity queries between polyhedra using surface decomposition, in: Proc. of Eurographics, 2001.
6. 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.
7. 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.
8. 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.
9. O. Knüppel, PROFIL/BIAS - A fast interval library, Computing 53 (1994) 277-288.
10. 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.
11. B. Mirtich, V-Clip: Fast and robust polyhedral collision detection, ACM Trans. Graphics 17 (1998) 177-208.
12. 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.
13. 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.
14. G. van den Bergen, A fast and robust GJK implementation for collision detection of convex objects, J. Graphics Tools 4(2) (1999) 7-25.