Title: | Efficient collision detection between 2D polygons |
Authors: | Jiménez, Juan José Segura, Rafael J. Feito, Francisco R. |
Citation: | Journal of WSCG. 2004, vol. 12, no. 1-3, p. 191-198. |
Issue Date: | 2004 |
Publisher: | UNION Agency |
Document type: | článek article |
URI: | http://wscg.zcu.cz/wscg2004/Papers_2004_Full/B83.pdf http://hdl.handle.net/11025/1748 |
ISSN: | 1213-6972 |
Keywords: | detekce kolizí;2D polygony;animace |
Keywords in different language: | collision detection;2D polygons;animation |
Abstract: | 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. |
Rights: | © UNION Agency |
Appears in Collections: | Volume 12, number 1-3 (2004) |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/1748
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.