A hierarchical method for real-time distance computation among moving convex bodies

Computational Geometry: Theory and Applications

Volumn 15, Issue 1-3, 2000, Pages 51-68

  Guibas, Leonidas J ^a   Hsu, David ^a   Zhang, Li ^a  

^a Stanford University   (United States)

Author keywords

Collision detection; Distance computation; Hierarchical methods; Moving objects; Temporal coherence

Indexed keywords

EID: 0345754733     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00042-5     Document Type: Article

References (14)

1. S. Cameron, Enhancing GJK: Computing minimum and penetration distances between convex polyhedra, in: Proc. IEEE Int. Conf. on Robotics and Automation, 1997.
2. J.D. Cohen, M.C. Lin, D. Manocha, M.K. Ponamgi, I-COLLIDE: An interactive and exact collision detection system for large-scale environments, in: 1995 Symposium on Interactive 3D Graphics, 1995, pp. 189-196.
3. D.P. Dobkin, D.G. Kirkpatrick, A linear algorithm for determining the separation of convex polyhedra, J. Algorithms 6 (1985) 381-392.
4. D.P. Dobkin, D.G. Kirkpatrick, Determining the separation of preprocessed polyhedra - A unified approach, in: Proc. 17th Internat. Colloq. Automata Languages Programming, Lecture Notes in Computer Science, Vol. 443, Springer, Berlin, 1990, pp. 400-413.
5. H. Edelsbrunner, Computing the extreme distances between two convex polygons, J. Algorithms 6 (1985) 213-224.
6. J. Erickson, L.J. Guibas, J. Stolfi, L. Zhang, Separation-sensitive convex collision detection, in: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 327-336.
7. E.G. Gilbert, D.W. Johnson, S.S. Keerthi, A fast procedure for computing the distance between complex objects, IEEE J. Robotics Autom. 4 (2) (1988).
8. S. Gottschalk, M. Lin, D. Manocha, OBB-Tree: A hierarchical structure for rapid interference detection, in: Computer Graphics (SIGGRAPH '96 Proceedings), 1996, pp. 171-180.
9. L.J. Guibas, E.M. McCreight, M.F. Plass, J.R. Roberts, A new representation for linear lists, in: Proc. ACM Symp. on Theory of Computing, 1977, pp. 49-60.
10. P.M. Hubbard, Collision detection for interactive graphics applications, IEEE Trans. Visual. Comput. Graphics 1 (3) (1995) 218-230.
11. P.M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection, ACM Trans. Graphics 15 (3) (1996) 179-210.
12. M.C. Lin, J.F. Canny, A fast algorithm for incremental distance calculation, in: Proc. IEEE Int. Conf. on Robotics and Automation, Vol. 2, 1991, pp. 1008-1014.
13. B. Mirtich, V-Clip: fast and robust polyhedral collision detection, Technical Report TR-97-05, Mitsubishi Electrical Research Laboratory, 1997.
14. S. Quinlan, Efficient distance computation between non-convex objects, in: Proc. IEEE Int. Conf. on Robotics and Automation, 1994, pp. 3324-3329.