Efficient triangle–triangle intersection test for OBB-based collision detection

We present an efficient algorithm for triangle–triangle intersection test in oriented bounding box (OBB)-based collision detection. In testing two OBB leaf nodes (i.e., rectangles), many intermediate computation results can be reused for the intersection test of two triangles they contain. It is con...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & graphics Jg. 33; H. 3; S. 235 - 240
Hauptverfasser: Chang, Jung-Woo, Kim, Myung-Soo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.06.2009
Schlagworte:
Collision detection
Coordinate representation
OBB
Triangle–triangle intersection
Coordinate representation
Triangle–triangle intersection
Collision detection
OBB
ISSN:0097-8493, 1873-7684
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an efficient algorithm for triangle–triangle intersection test in oriented bounding box (OBB)-based collision detection. In testing two OBB leaf nodes (i.e., rectangles), many intermediate computation results can be reused for the intersection test of two triangles they contain. It is considerably easier to detect redundant operations when we work in the local coordinate of the bounding rectangle rather than in the global coordinate of the object. The performance improvement of our algorithm is based on this observation that eliminates redundant computations. Compared with conventional algorithms, we have observed 15–79% improvement in computing time. We demonstrate the effectiveness of our approach using several experimental results.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0097-8493
1873-7684
DOI:10.1016/j.cag.2009.03.009