Název: Efficient collision detection between 2D polygons
Autoři: Jiménez, Juan José
Segura, Rafael J.
Feito, Francisco R.
Citace zdrojového dokumentu: Journal of WSCG. 2004, vol. 12, no. 1-3, p. 191-198.
Datum vydání: 2004
Nakladatel: UNION Agency
Typ dokumentu: article
URI: http://wscg.zcu.cz/wscg2004/Papers_2004_Full/B83.pdf
ISSN: 1213-6972
Klíčová slova: detekce kolizí;2D polygony;animace
Klíčová slova v dalším jazyce: collision detection;2D polygons;animation
Abstrakt: Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision detection algorithm which uses polygon decomposition through triangle coverings and polygon influence areas (implemented by signs of barycentric coordinates). By using influence areas and the temporal and spatial coherence property, the amount of time needed to detect a collision between objects is reduced. By means of these techniques, a valid representation for any kind of polygon is obtained, whether concave or convex, manifold or non-manifold, with or without holes, as well as a collision detection algorithm for this type of figures. This detection algorithm has been compared with the well-known PIVOT2D [Hof01] one and better results have been achieved in most situations. This improvement together with its possible extension to 3D makes it an attractive method because pre-processing of the polygons is no longer necessary. Besides, since this method uses sign operations, it proves to be a simple, more efficient and robust method.
Práva: © UNION Agency
Vyskytuje se v kolekcích:Volume 12, number 1-3 (2004)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
B83.pdf354,09 kBAdobe PDFZobrazit/otevřít

Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/1748

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.