The expected running time of hierarchical collision detection

ACM SIGGRAPH 2005 Posters, SIGGRAPH 2005

Volumn , Issue , 2005, Pages 117-

  Klein, Jan ^a   Zachmann, Gabriel ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION AVOIDANCE; COMPUTER GRAPHICS; OBJECT DETECTION;

AVERAGE RUNNING TIME; BOUNDING VOLUME HIERARCHIES; COLLISION DETECTION; EXPECTED RUNNING TIME;

INTERACTIVE COMPUTER GRAPHICS;

EID: 84983197177     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1186954.1187086     Document Type: Conference Paper

References (3)

1. GOTTSCHALK, S., LIN, M., AND MANOCHA, D. 1996. OBB-Tree: A hierarchical structure for rapid interference detection. ACM Transactions on Graphics (SIGGRAPH 1996) 15, 3, 171-180.
2. JAMES, D. L., AND PAI, D. K. 2004. BD-Tree: Output-sensitive collision detection for reduced deformable models. ACM Transactions on Graphics (SIGGRAPH 2004) 23, 3(Aug.), 393-398.
3. WEGHORST, H., HOOPER, G., AND GREENBERG, D. P. 1984. Improved computational methods for ray tracing. ACM Trans. Graph. 3, 1, 52-69.