13,458,235 members
alternative version

#### Stats

335.8K views
154 bookmarked
Posted 13 Sep 2006

# 2D Polygon Collision Detection

, 20 Sep 2006
An article on polygon collision detection. Can be used to implement collision between sprites in a 2D game. The algorithm can also be extended to 3D.

## Introduction

This article describes how to detect the collision between two moving (2D) polygons. It's not the first tutorial on the topic, however, the tutorials on the net tend to be a bit too complex for a relatively simple problem. The source codes I could find also had too many abbreviations that I don't get, or were crippled with C optimizations. So here, I'll try to keep it as simple as possible. In any case, it should be possible to include the functions presented here to your C# projects quite straightforwardly. The technique can be used to detect collisions between sprites as an alternative to pixel-perfect collisions which are usually too slow.

## Background

To detect if two polygons are intersecting, we use the Separating Axis Theorem. The idea is to find a line that separates both polygons - if such a line exists, the polygons are not intersecting (Fig. 1). The implementation of this theorem is relatively simple, and could be summed up in this pseudo code:

• For each edge of both polygons:
• Find the axis perpendicular to the current edge.
• Project both polygons on that axis.
• If these projections don't overlap, the polygons don't intersect (exit the loop).

This can be easily extended to deal with moving polygons by adding one additional step. After having checked that the current projections do not overlap, project the relative velocity of the polygons on the axis. Extend the projection of the first polygon by adding to it the velocity projection (Fig. 2). This will give you the interval spanned by the polygon over the duration of the motion. From there, you can use the technique used for static polygons: if the projections of polygons A and B don't overlap, the polygons won't collide. (NB: However, remember that if the intervals do overlap, it doesn't necessarily mean that the polygons will collide. We need to do the test for all the edges before knowing that.)

Once we have found that the polygons are going to collide, we calculate the translation needed to push the polygons apart. The axis on which the projection overlapping is minimum will be the one on which the collision will take place. We will push the first polygon along this axis. Then, the amount of translation will simply be the amount of overlapping on this axis (Fig. 3).

That is it! Now, each time a collision occurs, the first polygon will nicely slide along the surface of the other polygon.

Figure 1: Projections of the polygons onto an axis.

Figure 2: Projections for moving polygons.

Figure 3: Find the minimum interval overlapping, then calculate the translation required to push the polygons apart.

## Using the code

The `PolygonCollision()` function does all of the above, and returns a `PolygonCollisionResult` structure containing all the necessary information to handle the collision:

```// Structure that stores the results of the PolygonCollision function
public struct PolygonCollisionResult {
// Are the polygons going to intersect forward in time?
public bool WillIntersect;
// Are the polygons currently intersecting?
public bool Intersect;
// The translation to apply to the first polygon to push the polygons apart.
public Vector MinimumTranslationVector;
}```

Two helper functions are used by the `PolygonCollision` function. The first one is used to project a polygon onto an axis:

```// Calculate the projection of a polygon on an axis
// and returns it as a [min, max] interval
public void ProjectPolygon(Vector axis, Polygon polygon,
ref float min, ref float max) {
// To project a point on an axis use the dot product
float dotProduct = axis.DotProduct(polygon.Points[0]);
min = dotProduct;
max = dotProduct;
for (int i = 0; i < polygon.Points.Count; i++) {
dotProduct = polygon.Points[i].DotProduct(axis);
if (d < min) {
min = dotProduct;
} else {
if (dotProduct> max) {
max = dotProduct;
}
}
}
}```

The second one returns the signed distance between two given projections:

```// Calculate the distance between [minA, maxA] and [minB, maxB]
// The distance will be negative if the intervals overlap
public float IntervalDistance(float minA, float maxA, float minB, float maxB) {
if (minA < minB) {
return minB - maxA;
} else {
return minA - maxB;
}
}```

Finally, here is the main function:

```// Check if polygon A is going to collide with polygon B.
// The last parameter is the *relative* velocity
// of the polygons (i.e. velocityA - velocityB)
public PolygonCollisionResult PolygonCollision(Polygon polygonA,
Polygon polygonB, Vector velocity) {
PolygonCollisionResult result = new PolygonCollisionResult();
result.Intersect = true;
result.WillIntersect = true;

int edgeCountA = polygonA.Edges.Count;
int edgeCountB = polygonB.Edges.Count;
float minIntervalDistance = float.PositiveInfinity;
Vector translationAxis = new Vector();
Vector edge;

// Loop through all the edges of both polygons
for (int edgeIndex = 0; edgeIndex < edgeCountA + edgeCountB; edgeIndex++) {
if (edgeIndex < edgeCountA) {
edge = polygonA.Edges[edgeIndex];
} else {
edge = polygonB.Edges[edgeIndex - edgeCountA];
}

// ===== 1. Find if the polygons are currently intersecting =====

// Find the axis perpendicular to the current edge
Vector axis = new Vector(-edge.Y, edge.X);
axis.Normalize();

// Find the projection of the polygon on the current axis
float minA = 0; float minB = 0; float maxA = 0; float maxB = 0;
ProjectPolygon(axis, polygonA, ref minA, ref maxA);
ProjectPolygon(axis, polygonB, ref minB, ref maxB);

// Check if the polygon projections are currentlty intersecting
if (IntervalDistance(minA, maxA, minB, maxB) > 0)\
result.Intersect = false;

// ===== 2. Now find if the polygons *will* intersect =====

// Project the velocity on the current axis
float velocityProjection = axis.DotProduct(velocity);

// Get the projection of polygon A during the movement
if (velocityProjection < 0) {
minA += velocityProjection;
} else {
maxA += velocityProjection;
}

// Do the same test as above for the new projection
float intervalDistance = IntervalDistance(minA, maxA, minB, maxB);
if (intervalDistance > 0) result.WillIntersect = false;

// If the polygons are not intersecting and won't intersect, exit the loop
if (!result.Intersect && !result.WillIntersect) break;

// Check if the current interval distance is the minimum one. If so store
// the interval distance and the current distance.
// This will be used to calculate the minimum translation vector
intervalDistance = Math.Abs(intervalDistance);
if (intervalDistance < minIntervalDistance) {
minIntervalDistance = intervalDistance;
translationAxis = axis;

Vector d = polygonA.Center - polygonB.Center;
if (d.DotProduct(translationAxis) < 0)
translationAxis = -translationAxis;
}
}

// The minimum translation vector
// can be used to push the polygons appart.
if (result.WillIntersect)
result.MinimumTranslationVector =
translationAxis * minIntervalDistance;

return result;
}```

The function can be used this way:

```Vector polygonATranslation = new Vector();

PolygonCollisionResult r = PolygonCollision(polygonA, polygonB, velocity);

if (r.WillIntersect) {
// Move the polygon by its velocity, then move
// the polygons appart using the Minimum Translation Vector
polygonATranslation = velocity + r.MinimumTranslationVector;
} else {
// Just move the polygon by its velocity
polygonATranslation = velocity;
}

polygonA.Offset(polygonATranslation);```

## History

• September 13, 2006: First version.
• September 14, 2006: Minor changes, and added the Reference section.

## Share

 Software Developer Pogopixels Ltd United Kingdom
Pogopixels is a London based software company specialising in the development of widgets, Flash and internet-based software.

It delivers innovative software solutions to companies using the latest technologies including Adobe AIR, Yahoo Widgets, or Google Desktop.

On my spare time, I work on the Appetizer open source project: http://app.etizer.org It's a portable dock for Windows.

## You may also be interested in...

 Error in algorithm while translating moving objects position Shnarwhal13-Nov-11 1:38 Shnarwhal 13-Nov-11 1:38
 Collision for moving objects seems to be wrong. [modified] Thomas Happ30-Aug-11 9:29 Thomas Happ 30-Aug-11 9:29
 great, but small problem? bsabiston6-Jul-11 4:27 bsabiston 6-Jul-11 4:27
 My vote of 5 MSM_1-Feb-11 4:13 MSM_ 1-Feb-11 4:13
 Multiple collision kronenthaler13-May-09 9:34 kronenthaler 13-May-09 9:34
 This algorithm is wrong for moving object detection twobitshift8-Apr-09 12:25 twobitshift 8-Apr-09 12:25
 Consider a simple case. Of two axis aligned, squares that are moving. A:1-by-1 axis aligned square center: (2.5, 2.5) velocity: <-4,-4> (Va) B: 1-by-1 axis aligned square center: (-1.5, 2.5) velocity: <1, 0> (Vb) Using the above algorithm: relative velocity Vr = Va - Vb = <-4,-4> - <1,0> = <-5,-4> Since these are axis aligned, only two "edge-axis" to test: x-axis, y-axis Lets start with x-axis: axis = <1,0> Projection of A (Ax): min=2 max=3 Projection of B (Bx): min=-2 max=-1 Projection of Vr(Vx): -5 (Ax.min < Bx.min) = false: so IntervalDistance (ID) = Ax.min - Ax.max = 2 - (-1) = 3 ID >0 : so Intersect = false; Vx < 0: so A.min - Vx = 2 + (-5) = -7 -7 < Bx.min: so IntervalDistance for moving (IDm) = Bx.min - Ax.max = -1 - 3 = -4 IDm < 0: so WillIntersect = true! Now y-axis axis = <0, 1> Projection of A (Ay): min=2, max=3 Projection of B (By): min=2, max=3 Projection of Vr(Vy): -4 (Ay.min < By.min) = false: so ID = Ay.min - By.max = 2 - 3 = -1 ID <0: so Intersect = true Vy < 0: so A.min - Vy = 2 + (-4) = -6 -6 < By.min: so IDm = By.min = Ay.max = 1 -3 = -2 IDm < 0 so WillIntersect = true! So we have completed our loop and WillIntersect is set to True. Although this is also not true since the paths of these objects never actually cross. This is a short-cut that CAN be used to determine whether you need to perform a real detection test. This is very similar to sweep algorithms, if you are familiar with those. However it is no substitute (not even as an estimate) of real collision detection. modified on Wednesday, April 8, 2009 7:38 PM
 Re: This algorithm is wrong for moving object detection Evil OverLord24-Jul-09 21:36 Evil OverLord 24-Jul-09 21:36
 Re: This algorithm is wrong for moving object detection twobitshift30-Jul-09 6:10 twobitshift 30-Jul-09 6:10
 Re: This algorithm is wrong for moving object detection cajoncillos7-Sep-10 7:38 cajoncillos 7-Sep-10 7:38
 Re: This algorithm is wrong for moving object detection seifer50322-Jul-11 8:11 seifer503 22-Jul-11 8:11
 Re: This algorithm is wrong for moving object detection Member 1040355213-Aug-14 23:49 Member 10403552 13-Aug-14 23:49
 give example for concave polygons collision jjqcat18-Mar-09 15:23 jjqcat 18-Mar-09 15:23
 How To Fix Insane Processor Usage Reelix5-Mar-09 0:15 Reelix 5-Mar-09 0:15
 Just what I've been looking for... VCKicks3-Sep-08 9:01 VCKicks 3-Sep-08 9:01
 Points comparing Varangian28-Apr-08 23:25 Varangian 28-Apr-08 23:25
 Problem... Varangian28-Apr-08 23:23 Varangian 28-Apr-08 23:23
 A Small Bug Walter O Dias26-Dec-07 0:35 Walter O Dias 26-Dec-07 0:35
 Re: A Small Bug salute22-Jan-09 22:47 salute 22-Jan-09 22:47
 Just a small thing Jeppe A.22-Jun-07 21:34 Jeppe A. 22-Jun-07 21:34
 What about?... Super Lloyd25-Sep-06 13:18 Super Lloyd 25-Sep-06 13:18
 Re: What about?... Laurent Cozic26-Sep-06 5:50 Laurent Cozic 26-Sep-06 5:50
 good article TomekS22-Sep-06 1:08 TomekS 22-Sep-06 1:08
 Re: good article Khaniya1-Apr-10 0:46 Khaniya 1-Apr-10 0:46
 Good article. Here's another... Shawn Poulson20-Sep-06 15:22 Shawn Poulson 20-Sep-06 15:22
 Last Visit: 31-Dec-99 18:00     Last Update: 24-Mar-18 1:06 Refresh 12 Next »