메뉴 건너뛰기




Volumn 3, Issue , 2002, Pages 2329-2334

An experimental evaluation of collision detection packages for robot motion planning

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; MATHEMATICAL MODELS; MOBILE ROBOTS; RANDOM PROCESSES; ROBUSTNESS (CONTROL SYSTEMS); THREE DIMENSIONAL;

EID: 0036452425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (30)

References (24)
  • 6
    • 0029178789 scopus 로고
    • I-collide: An interactive and exact collision detection system for large-scale environments
    • J. Cohen, M. Lin, D. Manocha, and M. Ponamgi. I-Collide: an interactive and exact collision detection system for large-scale environments. ACM Int. 3D Graphics Conference, 1, 1995.
    • (1995) ACM Int. 3D Graphics Conference , vol.1
    • Cohen, J.1    Lin, M.2    Manocha, D.3    Ponamgi, M.4
  • 8
    • 0011717680 scopus 로고    scopus 로고
    • Accurate and fast proximity queries between polyhedra using convex surface decomposition
    • Manchester, UK
    • S. Ehmann and M. Lin. Accurate and fast proximity queries between polyhedra using convex surface decomposition. In Eurographics 2001, Manchester, UK, 2001.
    • (2001) Eurographics 2001
    • Ehmann, S.1    Lin, M.2
  • 10
    • 0023998710 scopus 로고
    • A fast procedure for computing the distance between complex objects in three dimensional space
    • E. Gilbert, D. Johnson, and S. Keerthi. A fast procedure for computing the distance between complex objects in three dimensional space. IEEE Journal of Robotics and Automation, 4(2):193-203, 1988.
    • (1988) IEEE Journal of Robotics and Automation , vol.4 , Issue.2 , pp. 193-203
    • Gilbert, E.1    Johnson, D.2    Keerthi, S.3
  • 11
    • 0030421708 scopus 로고    scopus 로고
    • OBBTree: A hierarchical structure for rapid interface detection
    • S. Gottschalk, M. Lin, and D. Manocha. OBBTree: a hierarchical structure for rapid interface detection. In ACM Siggraph, 1996.
    • (1996) ACM Siggraph
    • Gottschalk, S.1    Lin, M.2    Manocha, D.3
  • 16
    • 0004125062 scopus 로고    scopus 로고
    • Fast proximity queries with swept sphere volumes
    • Technical Report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill
    • E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Fast proximity queries with swept sphere volumes. Technical Report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill, 1999.
    • (1999)
    • Larsen, E.1    Gottschalk, S.2    Lin, M.3    Manocha, D.4
  • 21
    • 0032108781 scopus 로고    scopus 로고
    • VClip: Fast and robust polyhedral collision detection
    • B. Mirtich. VClip: fast and robust polyhedral collision detection. ACM Transaction on Graphics, 17(3):177-208, 1998.
    • (1998) ACM Transaction on Graphics , vol.17 , Issue.3 , pp. 177-208
    • Mirtich, B.1
  • 22
    • 0001779112 scopus 로고    scopus 로고
    • Efficient collision detection of complex deformable models using AABB trees
    • G. van den Bergen. Efficient collision detection of complex deformable models using AABB trees. Journal of Graphic Tools, 4(2):1-13, 1997.
    • (1997) Journal of Graphic Tools , vol.4 , Issue.2 , pp. 1-13
    • Van Den Bergen, G.1
  • 23
    • 0002490645 scopus 로고    scopus 로고
    • A fast and robust GJK implementation for collision detection of convex objects
    • G. van den Bergen. A fast and robust GJK implementation for collision detection of convex objects. Journal of Graphics Tools, 2(4):7-25, 1999.
    • (1999) Journal of Graphics Tools , vol.2 , Issue.4 , pp. 7-25
    • Van Den Bergen, G.1


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