You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.


+7 961 270-60-01

  • Collision detection algorithms flat two-dimensional objects of arbitrary shape

    The paper lists the most common methods for detection of intersections and an algorithm for resolving conflicts of flat two-dimensional objects with complex non-convex shapes. The developed algorithm is characterized by the absence of a convex decomposition of non-convex objects. Examples collision resolution two non-convex objects. The estimation of the average time of resolution of conflicts. The efficiency of the algorithm, which works in more than three times faster than considered unique.

    Keywords: collision detection algorithm, flat two-dimensional objects, non-convex contours, convex decomposition, algorithm GJK / EPA, Minkowski sum, separating axis theorem