메뉴 건너뛰기




Volumn 4, Issue , 1998, Pages 3685-3690

Computing distances between NURBS-defined convex objects

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTICS; COLLISION AVOIDANCE; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; MOTION PLANNING;

EID: 0031642994     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.1998.681406     Document Type: Conference Paper
Times cited : (34)

References (15)
  • 1
    • 85024530377 scopus 로고
    • A study of the clash detection problem in robotics
    • St. Louis, March
    • S. A. Cameron. A study of the clash detection problem in robotics. In IEEE Int. Conf. Robotics & Automation, pages 488-493, St. Louis, March 1985.
    • (1985) IEEE Int. Conf. Robotics & Automation , pp. 488-493
    • Cameron, S.A.1
  • 2
    • 0031336274 scopus 로고    scopus 로고
    • A comparison of two fast algorithms for computing the distance between convex polyhedra
    • December
    • Stephen Cameron. A comparison of two fast algorithms for computing the distance between convex polyhedra. IEEE Trans. Robotics & Automation, 13(6):915-920, December 1997.
    • (1997) IEEE Trans. Robotics & Automation , vol.13 , Issue.6 , pp. 915-920
    • Cameron, S.1
  • 3
    • 0030721293 scopus 로고    scopus 로고
    • Enhancing GJK: Computing minimum and penetration distances between convex polyhedra
    • Albuquerque, April
    • Stephen Cameron. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra. In IEEE Int. Conf. Robotics & Automation, pages 3112-3117, Albuquerque, April 1997.
    • (1997) IEEE Int. Conf. Robotics & Automation , pp. 3112-3117
    • Cameron, S.1
  • 5
    • 0029178789 scopus 로고
    • I-COLLIDE: An interactive and exact collision detection system for large scale environments
    • Monterey, April
    • J. Cohen, M. Lin, D. Manocha, and K. Ponamgi. I-COLLIDE: An interactive and exact collision detection system for large scale environments. In Interactive 3D Graphics Conference, pages 189-196, Monterey, April 1995.
    • (1995) Interactive 3D Graphics Conference , pp. 189-196
    • Cohen, J.1    Lin, M.2    Manocha, D.3    Ponamgi, K.4
  • 7
    • 0022583115 scopus 로고
    • A collision detection algorithm based on velocity and distance bounds
    • San Francisco, April
    • R. K. Culley and K. G. Kempf. A collision detection algorithm based on velocity and distance bounds. In IEEE Int. Conf. Robotics & Automation, pages 1064-1069, San Francisco, April 1986.
    • (1986) IEEE Int. Conf. Robotics & Automation , pp. 1064-1069
    • Culley, R.K.1    Kempf, K.G.2
  • 9
    • 0025385673 scopus 로고
    • Computing the distance between general convex objects in three-dimensional space
    • February
    • E. G. Gilbert and C-K Foo. Computing the distance between general convex objects in three-dimensional space. IEEE Trans. Robotics & Automation, 6(1):53-61, February 1990.
    • (1990) IEEE Trans. Robotics & Automation , vol.6 , Issue.1 , pp. 53-61
    • Gilbert, E.G.1    Foo, C.-K.2
  • 10
    • 0023998710 scopus 로고
    • A fast procedure for computing the distance between complex objects in three-dimensional space
    • April
    • 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 Trans. Robotics & Automation, 4(2):193-203, April 1988.
    • (1988) IEEE Trans. Robotics & Automation , vol.4 , Issue.2 , pp. 193-203
    • Gilbert, E.G.1    Johnson, D.W.2    Keerthi, S.S.3
  • 11
    • 0030718654 scopus 로고    scopus 로고
    • The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions
    • Albuquerque,April
    • E. G. Gilbert and C. J. Ong. The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions. In IEEE Int. Conf. Robotics & Automation, Albuquerque, April 1997.
    • (1997) IEEE Int. Conf. Robotics & Automation
    • Gilbert, E.G.1    Ong, C.J.2
  • 12
    • 0025724612 scopus 로고
    • A fast algorithm for incremental distance calculation
    • Sacremento, April
    • Ming Lin and John Canny. A fast algorithm for incremental distance calculation. In IEEE Int. Conf. Robotics & Automation, pages 1008-1014, Sacremento, April 1991.
    • (1991) IEEE Int. Conf. Robotics & Automation , pp. 1008-1014
    • Lin, M.1    Canny, J.2
  • 13
    • 85064091681 scopus 로고    scopus 로고
    • Technical Report TR-97-05, Mitsubishi Electric Research Laboratory, Cambridge MA June
    • Brian Mirtich. V-clip: Fast and robust polyhedral collision detection. Technical Report TR-97-05, Mitsubishi Electric Research Laboratory, Cambridge MA (www.merl.com), June 1997.
    • (1997) V-clip: Fast and Robust Polyhedral Collision Detection
    • Brian, M.1
  • 15
    • 0029192678 scopus 로고
    • Towards efficient motion planning for manipulators with complex geometry
    • Pittsburgh, August
    • Caigong Qin, Stephen Cameron, and Alistair McLean. Towards efficient motion planning for manipulators with complex geometry. In Proc. IEEE Int. Symp. Assembly and Task Planning, pages 207-212, Pittsburgh, August 1995.
    • (1995) Proc. IEEE Int. Symp. Assembly and Task Planning , pp. 207-212
    • Qin, C.1    Cameron, S.2    McLean, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.