Repository navigation
Expand file tree
/
Copy pathgjk.c
More file actions
229 lines (170 loc) · 7.01 KB
/
Copy pathgjk.c
File metadata and controls
229 lines (170 loc) · 7.01 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
// Created by Igor Kroitor on 29/12/15.
#include <stdio.h>
//-----------------------------------------------------------------------------
// Gilbert-Johnson-Keerthi (GJK) collision detection algorithm in 2D
// http://www.dyn4j.org/2010/04/gjk-gilbert-johnson-keerthi/
// http://mollyrocket.com/849
//-----------------------------------------------------------------------------
struct _vec2 { float x; float y; };
typedef struct _vec2 vec2;
//-----------------------------------------------------------------------------
// Basic vector arithmetic operations
vec2 subtract (vec2 a, vec2 b) { a.x -= b.x; a.y -= b.y; return a; }
vec2 negate (vec2 v) { v.x = -v.x; v.y = -v.y; return v; }
vec2 perpendicular (vec2 v) { vec2 p = { v.y, -v.x }; return p; }
float dotProduct (vec2 a, vec2 b) { return a.x * b.x + a.y * b.y; }
float lengthSquared (vec2 v) { return v.x * v.x + v.y * v.y; }
//-----------------------------------------------------------------------------
// Triple product expansion is used to calculate perpendicular normal vectors
// which kinda 'prefer' pointing towards the Origin in Minkowski space
vec2 tripleProduct (vec2 a, vec2 b, vec2 c) {
vec2 r;
float ac = a.x * c.x + a.y * c.y; // perform a.dot(c)
float bc = b.x * c.x + b.y * c.y; // perform b.dot(c)
// perform b * a.dot(c) - a * b.dot(c)
r.x = b.x * ac - a.x * bc;
r.y = b.y * ac - a.y * bc;
return r;
}
//-----------------------------------------------------------------------------
// This is to compute average center (roughly). It might be different from
// Center of Gravity, especially for bodies with nonuniform density,
// but this is ok as initial direction of simplex search in GJK.
vec2 averagePoint (const vec2 * vertices, size_t count) {
vec2 avg = { 0.f, 0.f };
for (size_t i = 0; i < count; i++) {
avg.x += vertices[i].x;
avg.y += vertices[i].y;
}
avg.x /= count;
avg.y /= count;
return avg;
}
//-----------------------------------------------------------------------------
// Get furthest vertex along a certain direction
size_t indexOfFurthestPoint (const vec2 * vertices, size_t count, vec2 d) {
float maxProduct = dotProduct (d, vertices[0]);
size_t index = 0;
for (size_t i = 1; i < count; i++) {
float product = dotProduct (d, vertices[i]);
if (product > maxProduct) {
maxProduct = product;
index = i;
}
}
return index;
}
//-----------------------------------------------------------------------------
// Minkowski sum support function for GJK
vec2 support (const vec2 * vertices1, size_t count1,
const vec2 * vertices2, size_t count2, vec2 d) {
// get furthest point of first body along an arbitrary direction
size_t i = indexOfFurthestPoint (vertices1, count1, d);
// get furthest point of second body along the opposite direction
size_t j = indexOfFurthestPoint (vertices2, count2, negate (d));
// subtract (Minkowski sum) the two points to see if bodies 'overlap'
return subtract (vertices1[i], vertices2[j]);
}
//-----------------------------------------------------------------------------
// The GJK yes/no test
int iter_count = 0;
int gjk (const vec2 * vertices1, size_t count1,
const vec2 * vertices2, size_t count2) {
size_t index = 0; // index of current vertex of simplex
vec2 a, b, c, d, ao, ab, ac, abperp, acperp, simplex[3];
vec2 position1 = averagePoint (vertices1, count1); // not a CoG but
vec2 position2 = averagePoint (vertices2, count2); // it's ok for GJK )
// initial direction from the center of 1st body to the center of 2nd body
d = subtract (position1, position2);
// if initial direction is zero – set it to any arbitrary axis (we choose X)
if ((d.x == 0) && (d.y == 0))
d.x = 1.f;
// set the first support as initial point of the new simplex
a = simplex[0] = support (vertices1, count1, vertices2, count2, d);
if (dotProduct (a, d) <= 0)
return 0; // no collision
d = negate (a); // The next search direction is always towards the origin, so the next search direction is negate(a)
while (1) {
iter_count++;
a = simplex[++index] = support (vertices1, count1, vertices2, count2, d);
if (dotProduct (a, d) <= 0)
return 0; // no collision
ao = negate (a); // from point A to Origin is just negative A
// simplex has 2 points (a line segment, not a triangle yet)
if (index < 2) {
b = simplex[0];
ab = subtract (b, a); // from point A to B
d = tripleProduct (ab, ao, ab); // normal to AB towards Origin
if (lengthSquared (d) == 0)
d = perpendicular (ab);
continue; // skip to next iteration
}
b = simplex[1];
c = simplex[0];
ab = subtract (b, a); // from point A to B
ac = subtract (c, a); // from point A to C
acperp = tripleProduct (ab, ac, ac);
if (dotProduct (acperp, ao) >= 0) {
d = acperp; // new direction is normal to AC towards Origin
} else {
abperp = tripleProduct (ac, ab, ab);
if (dotProduct (abperp, ao) < 0)
return 1; // collision
simplex[0] = simplex[1]; // swap first element (point C)
d = abperp; // new direction is normal to AB towards Origin
}
simplex[1] = simplex[2]; // swap element in the middle (point B)
--index;
}
return 0;
}
//-----------------------------------------------------------------------------
#include <stdlib.h>
#include <float.h>
float Perturbation()
{
return ((float)rand() / (float)RAND_MAX) * FLT_EPSILON * 100.0f * ((rand() % 2) ? 1.0f : -1.0f);
}
vec2 Jostle(vec2 a)
{
vec2 b;
b.x = a.x + Perturbation();
b.y = a.y + Perturbation();
return b;
}
int main(int argc, const char * argv[]) {
// test case from dyn4j
vec2 vertices1[] = {
{ 4.0f, 11.0f },
{ 5.0f, 5.0f },
{ 9.0f, 9.0f },
};
vec2 vertices2[] = {
{ 4.0f, 11.0f },
{ 5.0f, 5.0f },
{ 9.0f, 9.0f },
};
size_t count1 = sizeof (vertices1) / sizeof (vec2); // == 3
size_t count2 = sizeof (vertices2) / sizeof (vec2); // == 4
while (1)
{
vec2 a[sizeof (vertices1) / sizeof (vec2)];
vec2 b[sizeof (vertices2) / sizeof (vec2)];
for (size_t i = 0; i < count1; ++i) a[i] = Jostle(vertices1[i]);
for (size_t i = 0; i < count2; ++i) b[i] = Jostle(vertices2[i]);
int collisionDetected = gjk (a, count1, b, count2);
if (!collisionDetected)
{
printf("Found failing case:\n\t{%f, %f}, {%f, %f}, {%f, %f}\n\t{%f, %f}, {%f, %f}, {%f, %f}\n\n",
a[0].x, a[0].y, a[1].x, a[1].y, a[2].x, a[2].y,
b[0].x, b[0].y, b[1].x, b[1].y, b[2].x, b[2].y
);
}
else
{
printf("Collision correctly detected\n");
}
iter_count = 0;
}
return 0;
}