5 #define COLLISION_SNAPSCALE (32.0f)
6 #define COLLISION_SNAP (1.0f / COLLISION_SNAPSCALE)
7 #define COLLISION_SNAP2 (2.0f / COLLISION_SNAPSCALE)
8 #define COLLISION_PLANE_DIST_EPSILON (2.0f / COLLISION_SNAPSCALE)
10 cvar_t collision_impactnudge = {0, "collision_impactnudge", "0.03125", "how much to back off from the impact"};
11 cvar_t collision_startnudge = {0, "collision_startnudge", "0", "how much to bias collision trace start"};
12 cvar_t collision_endnudge = {0, "collision_endnudge", "0", "how much to bias collision trace end"};
13 cvar_t collision_enternudge = {0, "collision_enternudge", "0", "how much to bias collision entry fraction"};
14 cvar_t collision_leavenudge = {0, "collision_leavenudge", "0", "how much to bias collision exit fraction"};
15 cvar_t collision_prefernudgedfraction = {0, "collision_prefernudgedfraction", "1", "whether to sort collision events by nudged fraction (1) or real fraction (0)"};
17 void Collision_Init (void)
19 Cvar_RegisterVariable(&collision_impactnudge);
20 Cvar_RegisterVariable(&collision_startnudge);
21 Cvar_RegisterVariable(&collision_endnudge);
22 Cvar_RegisterVariable(&collision_enternudge);
23 Cvar_RegisterVariable(&collision_leavenudge);
24 Cvar_RegisterVariable(&collision_prefernudgedfraction);
40 void Collision_PrintBrushAsQHull(colbrushf_t *brush, const char *name)
43 Con_Printf("3 %s\n%i\n", name, brush->numpoints);
44 for (i = 0;i < brush->numpoints;i++)
45 Con_Printf("%f %f %f\n", brush->points[i].v[0], brush->points[i].v[1], brush->points[i].v[2]);
47 Con_Printf("4\n%i\n", brush->numplanes);
48 for (i = 0;i < brush->numplanes;i++)
49 Con_Printf("%f %f %f %f\n", brush->planes[i].normal[0], brush->planes[i].normal[1], brush->planes[i].normal[2], brush->planes[i].dist);
52 void Collision_ValidateBrush(colbrushf_t *brush)
54 int j, k, pointsoffplanes, pointonplanes, pointswithinsufficientplanes, printbrush;
57 if (!brush->numpoints)
59 Con_Print("Collision_ValidateBrush: brush with no points!\n");
63 // it's ok for a brush to have one point and no planes...
64 if (brush->numplanes == 0 && brush->numpoints != 1)
66 Con_Print("Collision_ValidateBrush: brush with no planes and more than one point!\n");
73 pointswithinsufficientplanes = 0;
74 for (k = 0;k < brush->numplanes;k++)
75 if (DotProduct(brush->planes[k].normal, brush->planes[k].normal) < 0.0001f)
76 Con_Printf("Collision_ValidateBrush: plane #%i (%f %f %f %f) is degenerate\n", k, brush->planes[k].normal[0], brush->planes[k].normal[1], brush->planes[k].normal[2], brush->planes[k].dist);
77 for (j = 0;j < brush->numpoints;j++)
80 for (k = 0;k < brush->numplanes;k++)
82 d = DotProduct(brush->points[j].v, brush->planes[k].normal) - brush->planes[k].dist;
83 if (d > COLLISION_PLANE_DIST_EPSILON)
85 Con_Printf("Collision_ValidateBrush: point #%i (%f %f %f) infront of plane #%i (%f %f %f %f)\n", j, brush->points[j].v[0], brush->points[j].v[1], brush->points[j].v[2], k, brush->planes[k].normal[0], brush->planes[k].normal[1], brush->planes[k].normal[2], brush->planes[k].dist);
88 if (fabs(d) > COLLISION_PLANE_DIST_EPSILON)
93 if (pointonplanes < 3)
94 pointswithinsufficientplanes++;
96 if (pointswithinsufficientplanes)
98 Con_Print("Collision_ValidateBrush: some points have insufficient planes, every point must be on at least 3 planes to form a corner.\n");
101 if (pointsoffplanes == 0) // all points are on all planes
103 Con_Print("Collision_ValidateBrush: all points lie on all planes (degenerate, no brush volume!)\n");
108 Collision_PrintBrushAsQHull(brush, "unnamed");
111 float nearestplanedist_float(const float *normal, const colpointf_t *points, int numpoints)
113 float dist, bestdist;
116 bestdist = DotProduct(points->v, normal);
120 dist = DotProduct(points->v, normal);
121 bestdist = min(bestdist, dist);
127 float furthestplanedist_float(const float *normal, const colpointf_t *points, int numpoints)
129 float dist, bestdist;
132 bestdist = DotProduct(points->v, normal);
136 dist = DotProduct(points->v, normal);
137 bestdist = max(bestdist, dist);
144 colbrushf_t *Collision_NewBrushFromPlanes(mempool_t *mempool, int numoriginalplanes, const colplanef_t *originalplanes, int supercontents)
146 // TODO: planesbuf could be replaced by a remapping table
147 int j, k, m, w, xyzflags;
148 int numpointsbuf = 0, maxpointsbuf = 256, numplanesbuf = 0, maxplanesbuf = 256, numelementsbuf = 0, maxelementsbuf = 256;
151 colpointf_t pointsbuf[256];
152 colplanef_t planesbuf[256];
153 int elementsbuf[1024];
154 int polypointbuf[256];
159 // enable these if debugging to avoid seeing garbage in unused data
160 memset(pointsbuf, 0, sizeof(pointsbuf));
161 memset(planesbuf, 0, sizeof(planesbuf));
162 memset(elementsbuf, 0, sizeof(elementsbuf));
163 memset(polypointbuf, 0, sizeof(polypointbuf));
164 memset(p, 0, sizeof(p));
166 // figure out how large a bounding box we need to properly compute this brush
168 for (j = 0;j < numoriginalplanes;j++)
169 maxdist = max(maxdist, fabs(originalplanes[j].dist));
170 // now make it large enough to enclose the entire brush, and round it off to a reasonable multiple of 1024
171 maxdist = floor(maxdist * (4.0 / 1024.0) + 2) * 1024.0;
172 // construct a collision brush (points, planes, and renderable mesh) from
173 // a set of planes, this also optimizes out any unnecessary planes (ones
174 // whose polygon is clipped away by the other planes)
175 for (j = 0;j < numoriginalplanes;j++)
177 // add the plane uniquely (no duplicates)
178 for (k = 0;k < numplanesbuf;k++)
179 if (VectorCompare(planesbuf[k].normal, originalplanes[j].normal) && planesbuf[k].dist == originalplanes[j].dist)
181 // if the plane is a duplicate, skip it
182 if (k < numplanesbuf)
184 // check if there are too many and skip the brush
185 if (numplanesbuf >= maxplanesbuf)
187 Con_DPrint("Collision_NewBrushFromPlanes: failed to build collision brush: too many planes for buffer\n");
192 VectorCopy(originalplanes[j].normal, planesbuf[numplanesbuf].normal);
193 planesbuf[numplanesbuf].dist = originalplanes[j].dist;
194 planesbuf[numplanesbuf].q3surfaceflags = originalplanes[j].q3surfaceflags;
195 planesbuf[numplanesbuf].texture = originalplanes[j].texture;
198 // create a large polygon from the plane
200 PolygonD_QuadForPlane(p[w], originalplanes[j].normal[0], originalplanes[j].normal[1], originalplanes[j].normal[2], originalplanes[j].dist, maxdist);
202 // clip it by all other planes
203 for (k = 0;k < numoriginalplanes && pnumpoints >= 3 && pnumpoints <= pmaxpoints;k++)
205 // skip the plane this polygon
206 // (nothing happens if it is processed, this is just an optimization)
209 // we want to keep the inside of the brush plane so we flip
211 PolygonD_Divide(pnumpoints, p[w], -originalplanes[k].normal[0], -originalplanes[k].normal[1], -originalplanes[k].normal[2], -originalplanes[k].dist, COLLISION_PLANE_DIST_EPSILON, pmaxpoints, p[!w], &pnumpoints, 0, NULL, NULL, NULL);
216 // if nothing is left, skip it
219 //Con_DPrintf("Collision_NewBrushFromPlanes: warning: polygon for plane %f %f %f %f clipped away\n", originalplanes[j].normal[0], originalplanes[j].normal[1], originalplanes[j].normal[2], originalplanes[j].dist);
223 for (k = 0;k < pnumpoints;k++)
227 for (l = 0;l < numoriginalplanes;l++)
228 if (fabs(DotProduct(&p[w][k*3], originalplanes[l].normal) - originalplanes[l].dist) < COLLISION_PLANE_DIST_EPSILON)
235 Con_DPrintf("Collision_NewBrushFromPlanes: warning: polygon point does not lie on at least 3 planes\n");
239 // check if there are too many polygon vertices for buffer
240 if (pnumpoints > pmaxpoints)
242 Con_DPrint("Collision_NewBrushFromPlanes: failed to build collision brush: too many points for buffer\n");
246 // check if there are too many triangle elements for buffer
247 if (numelementsbuf + (pnumpoints - 2) * 3 > maxelementsbuf)
249 Con_DPrint("Collision_NewBrushFromPlanes: failed to build collision brush: too many triangle elements for buffer\n");
253 for (k = 0;k < pnumpoints;k++)
256 // downgrade to float precision before comparing
257 VectorCopy(&p[w][k*3], v);
259 // check if there is already a matching point (no duplicates)
260 for (m = 0;m < numpointsbuf;m++)
261 if (VectorDistance2(v, pointsbuf[m].v) < COLLISION_SNAP2)
264 // if there is no match, add a new one
265 if (m == numpointsbuf)
267 // check if there are too many and skip the brush
268 if (numpointsbuf >= maxpointsbuf)
270 Con_DPrint("Collision_NewBrushFromPlanes: failed to build collision brush: too many points for buffer\n");
274 VectorCopy(&p[w][k*3], pointsbuf[numpointsbuf].v);
278 // store the index into a buffer
282 // add the triangles for the polygon
283 // (this particular code makes a triangle fan)
284 for (k = 0;k < pnumpoints - 2;k++)
286 elementsbuf[numelementsbuf++] = polypointbuf[0];
287 elementsbuf[numelementsbuf++] = polypointbuf[k + 1];
288 elementsbuf[numelementsbuf++] = polypointbuf[k + 2];
292 // if nothing is left, there's nothing to allocate
293 if (numplanesbuf < 4)
295 Con_DPrintf("Collision_NewBrushFromPlanes: failed to build collision brush: %i triangles, %i planes (input was %i planes), %i vertices\n", numelementsbuf / 3, numplanesbuf, numoriginalplanes, numpointsbuf);
299 // if no triangles or points could be constructed, then this routine failed but the brush is not discarded
300 if (numelementsbuf < 12 || numpointsbuf < 4)
301 Con_DPrintf("Collision_NewBrushFromPlanes: unable to rebuild triangles/points for collision brush: %i triangles, %i planes (input was %i planes), %i vertices\n", numelementsbuf / 3, numplanesbuf, numoriginalplanes, numpointsbuf);
303 // validate plane distances
304 for (j = 0;j < numplanesbuf;j++)
306 float d = furthestplanedist_float(planesbuf[j].normal, pointsbuf, numpointsbuf);
307 if (fabs(planesbuf[j].dist - d) > COLLISION_PLANE_DIST_EPSILON)
308 Con_DPrintf("plane %f %f %f %f mismatches dist %f\n", planesbuf[j].normal[0], planesbuf[j].normal[1], planesbuf[j].normal[2], planesbuf[j].dist, d);
311 // allocate the brush and copy to it
312 brush = (colbrushf_t *)Mem_Alloc(mempool, sizeof(colbrushf_t) + sizeof(colpointf_t) * numpointsbuf + sizeof(colplanef_t) * numplanesbuf + sizeof(int) * numelementsbuf);
313 brush->supercontents = supercontents;
314 brush->numplanes = numplanesbuf;
315 brush->numpoints = numpointsbuf;
316 brush->numtriangles = numelementsbuf / 3;
317 brush->planes = (colplanef_t *)(brush + 1);
318 brush->points = (colpointf_t *)(brush->planes + brush->numplanes);
319 brush->elements = (int *)(brush->points + brush->numpoints);
320 for (j = 0;j < brush->numpoints;j++)
322 brush->points[j].v[0] = pointsbuf[j].v[0];
323 brush->points[j].v[1] = pointsbuf[j].v[1];
324 brush->points[j].v[2] = pointsbuf[j].v[2];
326 for (j = 0;j < brush->numplanes;j++)
328 brush->planes[j].normal[0] = planesbuf[j].normal[0];
329 brush->planes[j].normal[1] = planesbuf[j].normal[1];
330 brush->planes[j].normal[2] = planesbuf[j].normal[2];
331 brush->planes[j].dist = planesbuf[j].dist;
332 brush->planes[j].q3surfaceflags = planesbuf[j].q3surfaceflags;
333 brush->planes[j].texture = planesbuf[j].texture;
335 for (j = 0;j < brush->numtriangles * 3;j++)
336 brush->elements[j] = elementsbuf[j];
339 VectorClear(brush->mins);
340 VectorClear(brush->maxs);
341 for (j = 0;j < min(6, numoriginalplanes);j++)
343 if (originalplanes[j].normal[0] == 1) {xyzflags |= 1;brush->maxs[0] = originalplanes[j].dist;}
344 else if (originalplanes[j].normal[0] == -1) {xyzflags |= 2;brush->mins[0] = -originalplanes[j].dist;}
345 else if (originalplanes[j].normal[1] == 1) {xyzflags |= 4;brush->maxs[1] = originalplanes[j].dist;}
346 else if (originalplanes[j].normal[1] == -1) {xyzflags |= 8;brush->mins[1] = -originalplanes[j].dist;}
347 else if (originalplanes[j].normal[2] == 1) {xyzflags |= 16;brush->maxs[2] = originalplanes[j].dist;}
348 else if (originalplanes[j].normal[2] == -1) {xyzflags |= 32;brush->mins[2] = -originalplanes[j].dist;}
350 // if not all xyzflags were set, then this is not a brush from q3map/q3map2, and needs reconstruction of the bounding box
351 // (this case works for any brush with valid points, but sometimes brushes are not reconstructed properly and hence the points are not valid, so this is reserved as a fallback case)
354 VectorCopy(brush->points[0].v, brush->mins);
355 VectorCopy(brush->points[0].v, brush->maxs);
356 for (j = 1;j < brush->numpoints;j++)
358 brush->mins[0] = min(brush->mins[0], brush->points[j].v[0]);
359 brush->mins[1] = min(brush->mins[1], brush->points[j].v[1]);
360 brush->mins[2] = min(brush->mins[2], brush->points[j].v[2]);
361 brush->maxs[0] = max(brush->maxs[0], brush->points[j].v[0]);
362 brush->maxs[1] = max(brush->maxs[1], brush->points[j].v[1]);
363 brush->maxs[2] = max(brush->maxs[2], brush->points[j].v[2]);
372 Collision_ValidateBrush(brush);
378 void Collision_CalcPlanesForPolygonBrushFloat(colbrushf_t *brush)
381 float edge0[3], edge1[3], edge2[3], normal[3], dist, bestdist;
384 // FIXME: these probably don't actually need to be normalized if the collision code does not care
385 if (brush->numpoints == 3)
387 // optimized triangle case
388 TriangleNormal(brush->points[0].v, brush->points[1].v, brush->points[2].v, brush->planes[0].normal);
389 if (DotProduct(brush->planes[0].normal, brush->planes[0].normal) < 0.0001f)
391 // there's no point in processing a degenerate triangle (GIGO - Garbage In, Garbage Out)
392 brush->numplanes = 0;
397 brush->numplanes = 5;
398 VectorNormalize(brush->planes[0].normal);
399 brush->planes[0].dist = DotProduct(brush->points->v, brush->planes[0].normal);
400 VectorNegate(brush->planes[0].normal, brush->planes[1].normal);
401 brush->planes[1].dist = -brush->planes[0].dist;
402 VectorSubtract(brush->points[2].v, brush->points[0].v, edge0);
403 VectorSubtract(brush->points[0].v, brush->points[1].v, edge1);
404 VectorSubtract(brush->points[1].v, brush->points[2].v, edge2);
407 float projectionnormal[3], projectionedge0[3], projectionedge1[3], projectionedge2[3];
409 float dist, bestdist;
410 bestdist = fabs(brush->planes[0].normal[0]);
412 for (i = 1;i < 3;i++)
414 dist = fabs(brush->planes[0].normal[i]);
421 VectorClear(projectionnormal);
422 if (brush->planes[0].normal[best] < 0)
423 projectionnormal[best] = -1;
425 projectionnormal[best] = 1;
426 VectorCopy(edge0, projectionedge0);
427 VectorCopy(edge1, projectionedge1);
428 VectorCopy(edge2, projectionedge2);
429 projectionedge0[best] = 0;
430 projectionedge1[best] = 0;
431 projectionedge2[best] = 0;
432 CrossProduct(projectionedge0, projectionnormal, brush->planes[2].normal);
433 CrossProduct(projectionedge1, projectionnormal, brush->planes[3].normal);
434 CrossProduct(projectionedge2, projectionnormal, brush->planes[4].normal);
437 CrossProduct(edge0, brush->planes->normal, brush->planes[2].normal);
438 CrossProduct(edge1, brush->planes->normal, brush->planes[3].normal);
439 CrossProduct(edge2, brush->planes->normal, brush->planes[4].normal);
441 VectorNormalize(brush->planes[2].normal);
442 VectorNormalize(brush->planes[3].normal);
443 VectorNormalize(brush->planes[4].normal);
444 brush->planes[2].dist = DotProduct(brush->points[2].v, brush->planes[2].normal);
445 brush->planes[3].dist = DotProduct(brush->points[0].v, brush->planes[3].normal);
446 brush->planes[4].dist = DotProduct(brush->points[1].v, brush->planes[4].normal);
448 if (developer.integer >= 100)
454 VectorSubtract(brush->points[0].v, brush->points[1].v, edge0);
455 VectorSubtract(brush->points[2].v, brush->points[1].v, edge1);
456 CrossProduct(edge0, edge1, normal);
457 VectorNormalize(normal);
458 VectorSubtract(normal, brush->planes[0].normal, temp);
459 if (VectorLength(temp) > 0.01f)
460 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: TriangleNormal gave wrong answer (%f %f %f != correct answer %f %f %f)\n", brush->planes->normal[0], brush->planes->normal[1], brush->planes->normal[2], normal[0], normal[1], normal[2]);
461 if (fabs(DotProduct(brush->planes[1].normal, brush->planes[0].normal) - -1.0f) > 0.01f || fabs(brush->planes[1].dist - -brush->planes[0].dist) > 0.01f)
462 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 1 (%f %f %f %f) is not opposite plane 0 (%f %f %f %f)\n", brush->planes[1].normal[0], brush->planes[1].normal[1], brush->planes[1].normal[2], brush->planes[1].dist, brush->planes[0].normal[0], brush->planes[0].normal[1], brush->planes[0].normal[2], brush->planes[0].dist);
464 if (fabs(DotProduct(brush->planes[2].normal, brush->planes[0].normal)) > 0.01f)
465 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 2 (%f %f %f %f) is not perpendicular to plane 0 (%f %f %f %f)\n", brush->planes[2].normal[0], brush->planes[2].normal[1], brush->planes[2].normal[2], brush->planes[2].dist, brush->planes[0].normal[0], brush->planes[0].normal[1], brush->planes[0].normal[2], brush->planes[2].dist);
466 if (fabs(DotProduct(brush->planes[3].normal, brush->planes[0].normal)) > 0.01f)
467 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 3 (%f %f %f %f) is not perpendicular to plane 0 (%f %f %f %f)\n", brush->planes[3].normal[0], brush->planes[3].normal[1], brush->planes[3].normal[2], brush->planes[3].dist, brush->planes[0].normal[0], brush->planes[0].normal[1], brush->planes[0].normal[2], brush->planes[3].dist);
468 if (fabs(DotProduct(brush->planes[4].normal, brush->planes[0].normal)) > 0.01f)
469 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 4 (%f %f %f %f) is not perpendicular to plane 0 (%f %f %f %f)\n", brush->planes[4].normal[0], brush->planes[4].normal[1], brush->planes[4].normal[2], brush->planes[4].dist, brush->planes[0].normal[0], brush->planes[0].normal[1], brush->planes[0].normal[2], brush->planes[4].dist);
470 if (fabs(DotProduct(brush->planes[2].normal, edge0)) > 0.01f)
471 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 2 (%f %f %f %f) is not perpendicular to edge 0 (%f %f %f to %f %f %f)\n", brush->planes[2].normal[0], brush->planes[2].normal[1], brush->planes[2].normal[2], brush->planes[2].dist, brush->points[2].v[0], brush->points[2].v[1], brush->points[2].v[2], brush->points[0].v[0], brush->points[0].v[1], brush->points[0].v[2]);
472 if (fabs(DotProduct(brush->planes[3].normal, edge1)) > 0.01f)
473 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 3 (%f %f %f %f) is not perpendicular to edge 1 (%f %f %f to %f %f %f)\n", brush->planes[3].normal[0], brush->planes[3].normal[1], brush->planes[3].normal[2], brush->planes[3].dist, brush->points[0].v[0], brush->points[0].v[1], brush->points[0].v[2], brush->points[1].v[0], brush->points[1].v[1], brush->points[1].v[2]);
474 if (fabs(DotProduct(brush->planes[4].normal, edge2)) > 0.01f)
475 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: plane 4 (%f %f %f %f) is not perpendicular to edge 2 (%f %f %f to %f %f %f)\n", brush->planes[4].normal[0], brush->planes[4].normal[1], brush->planes[4].normal[2], brush->planes[4].dist, brush->points[1].v[0], brush->points[1].v[1], brush->points[1].v[2], brush->points[2].v[0], brush->points[2].v[1], brush->points[2].v[2]);
478 if (fabs(DotProduct(brush->points[0].v, brush->planes[0].normal) - brush->planes[0].dist) > 0.01f || fabs(DotProduct(brush->points[1].v, brush->planes[0].normal) - brush->planes[0].dist) > 0.01f || fabs(DotProduct(brush->points[2].v, brush->planes[0].normal) - brush->planes[0].dist) > 0.01f)
479 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: edges (%f %f %f to %f %f %f to %f %f %f) off front plane 0 (%f %f %f %f)\n", brush->points[0].v[0], brush->points[0].v[1], brush->points[0].v[2], brush->points[1].v[0], brush->points[1].v[1], brush->points[1].v[2], brush->points[2].v[0], brush->points[2].v[1], brush->points[2].v[2], brush->planes[0].normal[0], brush->planes[0].normal[1], brush->planes[0].normal[2], brush->planes[0].dist);
480 if (fabs(DotProduct(brush->points[0].v, brush->planes[1].normal) - brush->planes[1].dist) > 0.01f || fabs(DotProduct(brush->points[1].v, brush->planes[1].normal) - brush->planes[1].dist) > 0.01f || fabs(DotProduct(brush->points[2].v, brush->planes[1].normal) - brush->planes[1].dist) > 0.01f)
481 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: edges (%f %f %f to %f %f %f to %f %f %f) off back plane 1 (%f %f %f %f)\n", brush->points[0].v[0], brush->points[0].v[1], brush->points[0].v[2], brush->points[1].v[0], brush->points[1].v[1], brush->points[1].v[2], brush->points[2].v[0], brush->points[2].v[1], brush->points[2].v[2], brush->planes[1].normal[0], brush->planes[1].normal[1], brush->planes[1].normal[2], brush->planes[1].dist);
482 if (fabs(DotProduct(brush->points[2].v, brush->planes[2].normal) - brush->planes[2].dist) > 0.01f || fabs(DotProduct(brush->points[0].v, brush->planes[2].normal) - brush->planes[2].dist) > 0.01f)
483 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: edge 0 (%f %f %f to %f %f %f) off front plane 2 (%f %f %f %f)\n", brush->points[2].v[0], brush->points[2].v[1], brush->points[2].v[2], brush->points[0].v[0], brush->points[0].v[1], brush->points[0].v[2], brush->planes[2].normal[0], brush->planes[2].normal[1], brush->planes[2].normal[2], brush->planes[2].dist);
484 if (fabs(DotProduct(brush->points[0].v, brush->planes[3].normal) - brush->planes[3].dist) > 0.01f || fabs(DotProduct(brush->points[1].v, brush->planes[3].normal) - brush->planes[3].dist) > 0.01f)
485 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: edge 0 (%f %f %f to %f %f %f) off front plane 2 (%f %f %f %f)\n", brush->points[0].v[0], brush->points[0].v[1], brush->points[0].v[2], brush->points[1].v[0], brush->points[1].v[1], brush->points[1].v[2], brush->planes[3].normal[0], brush->planes[3].normal[1], brush->planes[3].normal[2], brush->planes[3].dist);
486 if (fabs(DotProduct(brush->points[1].v, brush->planes[4].normal) - brush->planes[4].dist) > 0.01f || fabs(DotProduct(brush->points[2].v, brush->planes[4].normal) - brush->planes[4].dist) > 0.01f)
487 Con_Printf("Collision_CalcPlanesForPolygonBrushFloat: edge 0 (%f %f %f to %f %f %f) off front plane 2 (%f %f %f %f)\n", brush->points[1].v[0], brush->points[1].v[1], brush->points[1].v[2], brush->points[2].v[0], brush->points[2].v[1], brush->points[2].v[2], brush->planes[4].normal[0], brush->planes[4].normal[1], brush->planes[4].normal[2], brush->planes[4].dist);
493 // choose best surface normal for polygon's plane
495 for (i = 0, p = brush->points + 1;i < brush->numpoints - 2;i++, p++)
497 VectorSubtract(p[-1].v, p[0].v, edge0);
498 VectorSubtract(p[1].v, p[0].v, edge1);
499 CrossProduct(edge0, edge1, normal);
500 //TriangleNormal(p[-1].v, p[0].v, p[1].v, normal);
501 dist = DotProduct(normal, normal);
502 if (i == 0 || bestdist < dist)
505 VectorCopy(normal, brush->planes->normal);
508 if (bestdist < 0.0001f)
510 // there's no point in processing a degenerate triangle (GIGO - Garbage In, Garbage Out)
511 brush->numplanes = 0;
516 brush->numplanes = brush->numpoints + 2;
517 VectorNormalize(brush->planes->normal);
518 brush->planes->dist = DotProduct(brush->points->v, brush->planes->normal);
520 // negate plane to create other side
521 VectorNegate(brush->planes[0].normal, brush->planes[1].normal);
522 brush->planes[1].dist = -brush->planes[0].dist;
523 for (i = 0, p = brush->points + (brush->numpoints - 1), p2 = brush->points;i < brush->numpoints;i++, p = p2, p2++)
525 VectorSubtract(p->v, p2->v, edge0);
526 CrossProduct(edge0, brush->planes->normal, brush->planes[i + 2].normal);
527 VectorNormalize(brush->planes[i + 2].normal);
528 brush->planes[i + 2].dist = DotProduct(p->v, brush->planes[i + 2].normal);
533 if (developer.integer >= 100)
535 // validity check - will be disabled later
536 Collision_ValidateBrush(brush);
537 for (i = 0;i < brush->numplanes;i++)
540 for (j = 0, p = brush->points;j < brush->numpoints;j++, p++)
541 if (DotProduct(p->v, brush->planes[i].normal) > brush->planes[i].dist + COLLISION_PLANE_DIST_EPSILON)
542 Con_Printf("Error in brush plane generation, plane %i\n", i);
547 colbrushf_t *Collision_AllocBrushFromPermanentPolygonFloat(mempool_t *mempool, int numpoints, float *points, int supercontents)
550 brush = (colbrushf_t *)Mem_Alloc(mempool, sizeof(colbrushf_t) + sizeof(colplanef_t) * (numpoints + 2));
551 brush->supercontents = supercontents;
552 brush->numpoints = numpoints;
553 brush->numplanes = numpoints + 2;
554 brush->planes = (colplanef_t *)(brush + 1);
555 brush->points = (colpointf_t *)points;
556 Sys_Error("Collision_AllocBrushFromPermanentPolygonFloat: FIXME: this code needs to be updated to generate a mesh...");
560 // NOTE: start and end of each brush pair must have same numplanes/numpoints
561 void Collision_TraceBrushBrushFloat(trace_t *trace, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, const colbrushf_t *thatbrush_start, const colbrushf_t *thatbrush_end)
563 int nplane, nplane2, hitq3surfaceflags = 0;
564 float enterfrac = -1, leavefrac = 1, d1, d2, f, imove, newimpactnormal[3], enterfrac2 = -1;
565 const colplanef_t *startplane, *endplane;
566 texture_t *hittexture = NULL;
568 VectorClear(newimpactnormal);
570 for (nplane = 0;nplane < thatbrush_start->numplanes + thisbrush_start->numplanes;nplane++)
573 if (nplane2 >= thatbrush_start->numplanes)
575 nplane2 -= thatbrush_start->numplanes;
576 startplane = thisbrush_start->planes + nplane2;
577 endplane = thisbrush_end->planes + nplane2;
578 if (developer.integer >= 100)
580 // any brush with degenerate planes is not worth handling
581 if (DotProduct(startplane->normal, startplane->normal) < 0.9f || DotProduct(endplane->normal, endplane->normal) < 0.9f)
583 Con_Print("Collision_TraceBrushBrushFloat: degenerate thisbrush plane!\n");
586 f = furthestplanedist_float(startplane->normal, thisbrush_start->points, thisbrush_start->numpoints);
587 if (fabs(f - startplane->dist) > COLLISION_PLANE_DIST_EPSILON)
588 Con_Printf("startplane->dist %f != calculated %f (thisbrush_start)\n", startplane->dist, f);
590 d1 = nearestplanedist_float(startplane->normal, thisbrush_start->points, thisbrush_start->numpoints) - furthestplanedist_float(startplane->normal, thatbrush_start->points, thatbrush_start->numpoints) - collision_startnudge.value;
591 d2 = nearestplanedist_float(endplane->normal, thisbrush_end->points, thisbrush_end->numpoints) - furthestplanedist_float(endplane->normal, thatbrush_end->points, thatbrush_end->numpoints) - collision_endnudge.value;
595 startplane = thatbrush_start->planes + nplane2;
596 endplane = thatbrush_end->planes + nplane2;
597 if (developer.integer >= 100)
599 // any brush with degenerate planes is not worth handling
600 if (DotProduct(startplane->normal, startplane->normal) < 0.9f || DotProduct(endplane->normal, endplane->normal) < 0.9f)
602 Con_Print("Collision_TraceBrushBrushFloat: degenerate thatbrush plane!\n");
605 f = furthestplanedist_float(startplane->normal, thatbrush_start->points, thatbrush_start->numpoints);
606 if (fabs(f - startplane->dist) > COLLISION_PLANE_DIST_EPSILON)
607 Con_Printf("startplane->dist %f != calculated %f (thatbrush_start)\n", startplane->dist, f);
609 d1 = nearestplanedist_float(startplane->normal, thisbrush_start->points, thisbrush_start->numpoints) - startplane->dist - collision_startnudge.value;
610 d2 = nearestplanedist_float(endplane->normal, thisbrush_end->points, thisbrush_end->numpoints) - endplane->dist - collision_endnudge.value;
612 //Con_Printf("%c%i: d1 = %f, d2 = %f, d1 / (d1 - d2) = %f\n", nplane2 != nplane ? 'b' : 'a', nplane2, d1, d2, d1 / (d1 - d2));
622 imove = 1 / (d1 - d2);
623 f = (d1 - collision_enternudge.value) * imove;
624 // check if this will reduce the collision time range
627 // reduced collision time range
629 // if the collision time range is now empty, no collision
630 if (enterfrac > leavefrac)
632 // if the collision would be further away than the trace's
633 // existing collision data, we don't care about this
635 if (enterfrac > trace->realfraction)
637 // calculate the nudged fraction and impact normal we'll
638 // need if we accept this collision later
639 enterfrac2 = f - collision_impactnudge.value * imove;
640 VectorLerp(startplane->normal, enterfrac, endplane->normal, newimpactnormal);
641 hitq3surfaceflags = startplane->q3surfaceflags;
642 hittexture = startplane->texture;
648 // moving out of brush
654 f = (d1 + collision_leavenudge.value) / (d1 - d2);
655 // check if this will reduce the collision time range
658 // reduced collision time range
660 // if the collision time range is now empty, no collision
661 if (enterfrac > leavefrac)
668 // at this point we know the trace overlaps the brush because it was not
669 // rejected at any point in the loop above
671 // see if this brush can block the trace or not according to contents
672 if (trace->hitsupercontentsmask & thatbrush_start->supercontents)
676 trace->startsupercontents |= thatbrush_start->supercontents;
677 trace->startsolid = true;
679 trace->allsolid = true;
681 // store out the impact information
682 trace->hitsupercontents = thatbrush_start->supercontents;
683 trace->hitq3surfaceflags = hitq3surfaceflags;
684 trace->hittexture = hittexture;
685 trace->realfraction = bound(0, enterfrac, 1);
686 trace->fraction = bound(0, enterfrac2, 1);
687 if (collision_prefernudgedfraction.integer)
688 trace->realfraction = trace->fraction;
689 VectorCopy(newimpactnormal, trace->plane.normal);
693 // this brush can not block the trace, but it can update start contents
695 trace->startsupercontents |= thatbrush_start->supercontents;
699 // NOTE: start and end brush pair must have same numplanes/numpoints
700 void Collision_TraceLineBrushFloat(trace_t *trace, const vec3_t linestart, const vec3_t lineend, const colbrushf_t *thatbrush_start, const colbrushf_t *thatbrush_end)
702 int nplane, hitq3surfaceflags = 0;
703 float enterfrac = -1, leavefrac = 1, d1, d2, f, imove, newimpactnormal[3], enterfrac2 = -1;
704 const colplanef_t *startplane, *endplane;
705 texture_t *hittexture = NULL;
707 VectorClear(newimpactnormal);
709 for (nplane = 0;nplane < thatbrush_start->numplanes;nplane++)
711 startplane = thatbrush_start->planes + nplane;
712 endplane = thatbrush_end->planes + nplane;
713 d1 = DotProduct(startplane->normal, linestart) - startplane->dist - collision_startnudge.value;
714 d2 = DotProduct(endplane->normal, lineend) - endplane->dist - collision_endnudge.value;
715 if (developer.integer >= 100)
717 // any brush with degenerate planes is not worth handling
718 if (DotProduct(startplane->normal, startplane->normal) < 0.9f || DotProduct(endplane->normal, endplane->normal) < 0.9f)
720 Con_Print("Collision_TraceLineBrushFloat: degenerate plane!\n");
723 if (thatbrush_start->numpoints)
725 f = furthestplanedist_float(startplane->normal, thatbrush_start->points, thatbrush_start->numpoints);
726 if (fabs(f - startplane->dist) > COLLISION_PLANE_DIST_EPSILON)
727 Con_Printf("startplane->dist %f != calculated %f\n", startplane->dist, f);
739 imove = 1 / (d1 - d2);
740 f = (d1 - collision_enternudge.value) * imove;
741 // check if this will reduce the collision time range
744 // reduced collision time range
746 // if the collision time range is now empty, no collision
747 if (enterfrac > leavefrac)
749 // if the collision would be further away than the trace's
750 // existing collision data, we don't care about this
752 if (enterfrac > trace->realfraction)
754 // calculate the nudged fraction and impact normal we'll
755 // need if we accept this collision later
756 enterfrac2 = f - collision_impactnudge.value * imove;
757 VectorLerp(startplane->normal, enterfrac, endplane->normal, newimpactnormal);
758 hitq3surfaceflags = startplane->q3surfaceflags;
759 hittexture = startplane->texture;
765 // moving out of brush
771 f = (d1 + collision_leavenudge.value) / (d1 - d2);
772 // check if this will reduce the collision time range
775 // reduced collision time range
777 // if the collision time range is now empty, no collision
778 if (enterfrac > leavefrac)
785 // at this point we know the trace overlaps the brush because it was not
786 // rejected at any point in the loop above
788 // see if this brush can block the trace or not according to contents
789 if (trace->hitsupercontentsmask & thatbrush_start->supercontents)
793 trace->startsupercontents |= thatbrush_start->supercontents;
794 trace->startsolid = true;
796 trace->allsolid = true;
798 // store out the impact information
799 trace->hitsupercontents = thatbrush_start->supercontents;
800 trace->hitq3surfaceflags = hitq3surfaceflags;
801 trace->hittexture = hittexture;
802 trace->realfraction = bound(0, enterfrac, 1);
803 trace->fraction = bound(0, enterfrac2, 1);
804 if (collision_prefernudgedfraction.integer)
805 trace->realfraction = trace->fraction;
806 VectorCopy(newimpactnormal, trace->plane.normal);
810 // this brush can not block the trace, but it can update start contents
812 trace->startsupercontents |= thatbrush_start->supercontents;
816 void Collision_TracePointBrushFloat(trace_t *trace, const vec3_t point, const colbrushf_t *thatbrush)
819 const colplanef_t *plane;
821 for (nplane = 0, plane = thatbrush->planes;nplane < thatbrush->numplanes;nplane++, plane++)
822 if (DotProduct(plane->normal, point) > plane->dist)
825 trace->startsupercontents |= thatbrush->supercontents;
826 if (trace->hitsupercontentsmask & thatbrush->supercontents)
828 trace->startsolid = true;
829 trace->allsolid = true;
833 static colpointf_t polyf_points[256];
834 static colplanef_t polyf_planes[256 + 2];
835 static colbrushf_t polyf_brush;
837 void Collision_SnapCopyPoints(int numpoints, const colpointf_t *in, colpointf_t *out, float fractionprecision, float invfractionprecision)
840 for (i = 0;i < numpoints;i++)
842 out[i].v[0] = floor(in[i].v[0] * fractionprecision + 0.5f) * invfractionprecision;
843 out[i].v[1] = floor(in[i].v[1] * fractionprecision + 0.5f) * invfractionprecision;
844 out[i].v[2] = floor(in[i].v[2] * fractionprecision + 0.5f) * invfractionprecision;
848 void Collision_TraceBrushPolygonFloat(trace_t *trace, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int numpoints, const float *points, int supercontents)
852 Con_Print("Polygon with more than 256 points not supported yet (fixme!)\n");
855 polyf_brush.numpoints = numpoints;
856 polyf_brush.numplanes = numpoints + 2;
857 //polyf_brush.points = (colpointf_t *)points;
858 polyf_brush.planes = polyf_planes;
859 polyf_brush.supercontents = supercontents;
860 polyf_brush.points = polyf_points;
861 Collision_SnapCopyPoints(polyf_brush.numpoints, (colpointf_t *)points, polyf_points, COLLISION_SNAPSCALE, COLLISION_SNAP);
862 Collision_CalcPlanesForPolygonBrushFloat(&polyf_brush);
863 //Collision_PrintBrushAsQHull(&polyf_brush, "polyf_brush");
864 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, &polyf_brush, &polyf_brush);
867 void Collision_TraceBrushTriangleMeshFloat(trace_t *trace, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int numtriangles, const int *element3i, const float *vertex3f, int supercontents, int q3surfaceflags, texture_t *texture, const vec3_t segmentmins, const vec3_t segmentmaxs)
870 polyf_brush.numpoints = 3;
871 polyf_brush.numplanes = 5;
872 polyf_brush.points = polyf_points;
873 polyf_brush.planes = polyf_planes;
874 polyf_brush.supercontents = supercontents;
875 for (i = 0;i < polyf_brush.numplanes;i++)
877 polyf_brush.planes[i].q3surfaceflags = q3surfaceflags;
878 polyf_brush.planes[i].texture = texture;
880 for (i = 0;i < numtriangles;i++, element3i += 3)
882 if (segmentmaxs[0] >= min(vertex3f[element3i[0]*3+0], min(vertex3f[element3i[1]*3+0], vertex3f[element3i[2]*3+0]))
883 && segmentmins[0] <= max(vertex3f[element3i[0]*3+0], max(vertex3f[element3i[1]*3+0], vertex3f[element3i[2]*3+0]))
884 && segmentmaxs[1] >= min(vertex3f[element3i[0]*3+1], min(vertex3f[element3i[1]*3+1], vertex3f[element3i[2]*3+1]))
885 && segmentmins[1] <= max(vertex3f[element3i[0]*3+1], max(vertex3f[element3i[1]*3+1], vertex3f[element3i[2]*3+1]))
886 && segmentmaxs[2] >= min(vertex3f[element3i[0]*3+2], min(vertex3f[element3i[1]*3+2], vertex3f[element3i[2]*3+2]))
887 && segmentmins[2] <= max(vertex3f[element3i[0]*3+2], max(vertex3f[element3i[1]*3+2], vertex3f[element3i[2]*3+2])))
889 VectorCopy(vertex3f + element3i[0] * 3, polyf_points[0].v);
890 VectorCopy(vertex3f + element3i[1] * 3, polyf_points[1].v);
891 VectorCopy(vertex3f + element3i[2] * 3, polyf_points[2].v);
892 Collision_SnapCopyPoints(polyf_brush.numpoints, polyf_points, polyf_points, COLLISION_SNAPSCALE, COLLISION_SNAP);
893 Collision_CalcPlanesForPolygonBrushFloat(&polyf_brush);
894 //Collision_PrintBrushAsQHull(&polyf_brush, "polyf_brush");
895 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, &polyf_brush, &polyf_brush);
900 void Collision_TraceLinePolygonFloat(trace_t *trace, const vec3_t linestart, const vec3_t lineend, int numpoints, const float *points, int supercontents)
904 Con_Print("Polygon with more than 256 points not supported yet (fixme!)\n");
907 polyf_brush.numpoints = numpoints;
908 polyf_brush.numplanes = numpoints + 2;
909 //polyf_brush.points = (colpointf_t *)points;
910 polyf_brush.points = polyf_points;
911 Collision_SnapCopyPoints(polyf_brush.numpoints, (colpointf_t *)points, polyf_points, COLLISION_SNAPSCALE, COLLISION_SNAP);
912 polyf_brush.planes = polyf_planes;
913 polyf_brush.supercontents = supercontents;
914 Collision_CalcPlanesForPolygonBrushFloat(&polyf_brush);
915 //Collision_PrintBrushAsQHull(&polyf_brush, "polyf_brush");
916 Collision_TraceLineBrushFloat(trace, linestart, lineend, &polyf_brush, &polyf_brush);
919 void Collision_TraceLineTriangleMeshFloat(trace_t *trace, const vec3_t linestart, const vec3_t lineend, int numtriangles, const int *element3i, const float *vertex3f, int supercontents, int q3surfaceflags, texture_t *texture, const vec3_t segmentmins, const vec3_t segmentmaxs)
923 // FIXME: snap vertices?
924 for (i = 0;i < numtriangles;i++, element3i += 3)
925 Collision_TraceLineTriangleFloat(trace, linestart, lineend, vertex3f + element3i[0] * 3, vertex3f + element3i[1] * 3, vertex3f + element3i[2] * 3, supercontents, q3surfaceflags, texture);
927 polyf_brush.numpoints = 3;
928 polyf_brush.numplanes = 5;
929 polyf_brush.points = polyf_points;
930 polyf_brush.planes = polyf_planes;
931 polyf_brush.supercontents = supercontents;
932 for (i = 0;i < polyf_brush.numplanes;i++)
934 polyf_brush.planes[i].supercontents = supercontents;
935 polyf_brush.planes[i].q3surfaceflags = q3surfaceflags;
936 polyf_brush.planes[i].texture = texture;
938 for (i = 0;i < numtriangles;i++, element3i += 3)
940 if (segmentmaxs[0] >= min(vertex3f[element3i[0]*3+0], min(vertex3f[element3i[1]*3+0], vertex3f[element3i[2]*3+0]))
941 && segmentmins[0] <= max(vertex3f[element3i[0]*3+0], max(vertex3f[element3i[1]*3+0], vertex3f[element3i[2]*3+0]))
942 && segmentmaxs[1] >= min(vertex3f[element3i[0]*3+1], min(vertex3f[element3i[1]*3+1], vertex3f[element3i[2]*3+1]))
943 && segmentmins[1] <= max(vertex3f[element3i[0]*3+1], max(vertex3f[element3i[1]*3+1], vertex3f[element3i[2]*3+1]))
944 && segmentmaxs[2] >= min(vertex3f[element3i[0]*3+2], min(vertex3f[element3i[1]*3+2], vertex3f[element3i[2]*3+2]))
945 && segmentmins[2] <= max(vertex3f[element3i[0]*3+2], max(vertex3f[element3i[1]*3+2], vertex3f[element3i[2]*3+2])))
947 VectorCopy(vertex3f + element3i[0] * 3, polyf_points[0].v);
948 VectorCopy(vertex3f + element3i[1] * 3, polyf_points[1].v);
949 VectorCopy(vertex3f + element3i[2] * 3, polyf_points[2].v);
950 Collision_SnapCopyPoints(polyf_brush.numpoints, polyf_points, polyf_points, COLLISION_SNAPSCALE, COLLISION_SNAP);
951 Collision_CalcPlanesForPolygonBrushFloat(&polyf_brush);
952 //Collision_PrintBrushAsQHull(&polyf_brush, "polyf_brush");
953 Collision_TraceLineBrushFloat(trace, linestart, lineend, &polyf_brush, &polyf_brush);
960 static colpointf_t polyf_pointsstart[256], polyf_pointsend[256];
961 static colplanef_t polyf_planesstart[256 + 2], polyf_planesend[256 + 2];
962 static colbrushf_t polyf_brushstart, polyf_brushend;
964 void Collision_TraceBrushPolygonTransformFloat(trace_t *trace, const colbrushf_t *thisbrush_start, const colbrushf_t *thisbrush_end, int numpoints, const float *points, const matrix4x4_t *polygonmatrixstart, const matrix4x4_t *polygonmatrixend, int supercontents, int q3surfaceflags, texture_t *texture)
969 Con_Print("Polygon with more than 256 points not supported yet (fixme!)\n");
972 polyf_brushstart.numpoints = numpoints;
973 polyf_brushstart.numplanes = numpoints + 2;
974 polyf_brushstart.points = polyf_pointsstart;//(colpointf_t *)points;
975 polyf_brushstart.planes = polyf_planesstart;
976 polyf_brushstart.supercontents = supercontents;
977 for (i = 0;i < numpoints;i++)
978 Matrix4x4_Transform(polygonmatrixstart, points + i * 3, polyf_brushstart.points[i].v);
979 polyf_brushend.numpoints = numpoints;
980 polyf_brushend.numplanes = numpoints + 2;
981 polyf_brushend.points = polyf_pointsend;//(colpointf_t *)points;
982 polyf_brushend.planes = polyf_planesend;
983 polyf_brushend.supercontents = supercontents;
984 for (i = 0;i < numpoints;i++)
985 Matrix4x4_Transform(polygonmatrixend, points + i * 3, polyf_brushend.points[i].v);
986 for (i = 0;i < polyf_brushstart.numplanes;i++)
988 polyf_brushstart.planes[i].q3surfaceflags = q3surfaceflags;
989 polyf_brushstart.planes[i].texture = texture;
991 Collision_SnapCopyPoints(polyf_brushstart.numpoints, polyf_pointsstart, polyf_pointsstart, COLLISION_SNAPSCALE, COLLISION_SNAP);
992 Collision_SnapCopyPoints(polyf_brushend.numpoints, polyf_pointsend, polyf_pointsend, COLLISION_SNAPSCALE, COLLISION_SNAP);
993 Collision_CalcPlanesForPolygonBrushFloat(&polyf_brushstart);
994 Collision_CalcPlanesForPolygonBrushFloat(&polyf_brushend);
996 //Collision_PrintBrushAsQHull(&polyf_brushstart, "polyf_brushstart");
997 //Collision_PrintBrushAsQHull(&polyf_brushend, "polyf_brushend");
999 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, &polyf_brushstart, &polyf_brushend);
1004 #define MAX_BRUSHFORBOX 16
1005 static int brushforbox_index = 0;
1006 static colpointf_t brushforbox_point[MAX_BRUSHFORBOX*8];
1007 static colplanef_t brushforbox_plane[MAX_BRUSHFORBOX*6];
1008 static colbrushf_t brushforbox_brush[MAX_BRUSHFORBOX];
1009 static colbrushf_t brushforpoint_brush[MAX_BRUSHFORBOX];
1011 void Collision_InitBrushForBox(void)
1014 for (i = 0;i < MAX_BRUSHFORBOX;i++)
1016 brushforbox_brush[i].numpoints = 8;
1017 brushforbox_brush[i].numplanes = 6;
1018 brushforbox_brush[i].points = brushforbox_point + i * 8;
1019 brushforbox_brush[i].planes = brushforbox_plane + i * 6;
1020 brushforpoint_brush[i].numpoints = 1;
1021 brushforpoint_brush[i].numplanes = 0;
1022 brushforpoint_brush[i].points = brushforbox_point + i * 8;
1023 brushforpoint_brush[i].planes = brushforbox_plane + i * 6;
1027 colbrushf_t *Collision_BrushForBox(const matrix4x4_t *matrix, const vec3_t mins, const vec3_t maxs, int supercontents, int q3surfaceflags, texture_t *texture)
1032 if (brushforbox_brush[0].numpoints == 0)
1033 Collision_InitBrushForBox();
1034 // FIXME: these probably don't actually need to be normalized if the collision code does not care
1035 if (VectorCompare(mins, maxs))
1038 brush = brushforpoint_brush + ((brushforbox_index++) % MAX_BRUSHFORBOX);
1039 VectorCopy(mins, brush->points->v);
1043 brush = brushforbox_brush + ((brushforbox_index++) % MAX_BRUSHFORBOX);
1045 for (i = 0;i < 8;i++)
1047 v[0] = i & 1 ? maxs[0] : mins[0];
1048 v[1] = i & 2 ? maxs[1] : mins[1];
1049 v[2] = i & 4 ? maxs[2] : mins[2];
1050 Matrix4x4_Transform(matrix, v, brush->points[i].v);
1053 for (i = 0;i < 6;i++)
1056 v[i >> 1] = i & 1 ? 1 : -1;
1057 Matrix4x4_Transform3x3(matrix, v, brush->planes[i].normal);
1058 VectorNormalize(brush->planes[i].normal);
1061 brush->supercontents = supercontents;
1062 for (j = 0;j < brush->numplanes;j++)
1064 brush->planes[j].q3surfaceflags = q3surfaceflags;
1065 brush->planes[j].texture = texture;
1066 brush->planes[j].dist = furthestplanedist_float(brush->planes[j].normal, brush->points, brush->numpoints);
1068 VectorCopy(brush->points[0].v, brush->mins);
1069 VectorCopy(brush->points[0].v, brush->maxs);
1070 for (j = 1;j < brush->numpoints;j++)
1072 brush->mins[0] = min(brush->mins[0], brush->points[j].v[0]);
1073 brush->mins[1] = min(brush->mins[1], brush->points[j].v[1]);
1074 brush->mins[2] = min(brush->mins[2], brush->points[j].v[2]);
1075 brush->maxs[0] = max(brush->maxs[0], brush->points[j].v[0]);
1076 brush->maxs[1] = max(brush->maxs[1], brush->points[j].v[1]);
1077 brush->maxs[2] = max(brush->maxs[2], brush->points[j].v[2]);
1079 brush->mins[0] -= 1;
1080 brush->mins[1] -= 1;
1081 brush->mins[2] -= 1;
1082 brush->maxs[0] += 1;
1083 brush->maxs[1] += 1;
1084 brush->maxs[2] += 1;
1085 Collision_ValidateBrush(brush);
1089 void Collision_ClipTrace_BrushBox(trace_t *trace, const vec3_t cmins, const vec3_t cmaxs, const vec3_t start, const vec3_t mins, const vec3_t maxs, const vec3_t end, int hitsupercontentsmask, int supercontents, int q3surfaceflags, texture_t *texture)
1091 colbrushf_t *boxbrush, *thisbrush_start, *thisbrush_end;
1092 vec3_t startmins, startmaxs, endmins, endmaxs;
1094 // create brushes for the collision
1095 VectorAdd(start, mins, startmins);
1096 VectorAdd(start, maxs, startmaxs);
1097 VectorAdd(end, mins, endmins);
1098 VectorAdd(end, maxs, endmaxs);
1099 boxbrush = Collision_BrushForBox(&identitymatrix, cmins, cmaxs, supercontents, q3surfaceflags, texture);
1100 thisbrush_start = Collision_BrushForBox(&identitymatrix, startmins, startmaxs, 0, 0, NULL);
1101 thisbrush_end = Collision_BrushForBox(&identitymatrix, endmins, endmaxs, 0, 0, NULL);
1103 memset(trace, 0, sizeof(trace_t));
1104 trace->hitsupercontentsmask = hitsupercontentsmask;
1105 trace->fraction = 1;
1106 trace->realfraction = 1;
1107 trace->allsolid = true;
1108 Collision_TraceBrushBrushFloat(trace, thisbrush_start, thisbrush_end, boxbrush, boxbrush);
1111 //pseudocode for detecting line/sphere overlap without calculating an impact point
1112 //linesphereorigin = sphereorigin - linestart;linediff = lineend - linestart;linespherefrac = DotProduct(linesphereorigin, linediff) / DotProduct(linediff, linediff);return VectorLength2(linesphereorigin - bound(0, linespherefrac, 1) * linediff) >= sphereradius*sphereradius;
1114 // LordHavoc: currently unused, but tested
1115 // note: this can be used for tracing a moving sphere vs a stationary sphere,
1116 // by simply adding the moving sphere's radius to the sphereradius parameter,
1117 // all the results are correct (impactpoint, impactnormal, and fraction)
1118 float Collision_ClipTrace_Line_Sphere(double *linestart, double *lineend, double *sphereorigin, double sphereradius, double *impactpoint, double *impactnormal)
1120 double dir[3], scale, v[3], deviationdist, impactdist, linelength;
1121 // make sure the impactpoint and impactnormal are valid even if there is
1123 VectorCopy(lineend, impactpoint);
1124 VectorClear(impactnormal);
1125 // calculate line direction
1126 VectorSubtract(lineend, linestart, dir);
1127 // normalize direction
1128 linelength = VectorLength(dir);
1131 scale = 1.0 / linelength;
1132 VectorScale(dir, scale, dir);
1134 // this dotproduct calculates the distance along the line at which the
1135 // sphere origin is (nearest point to the sphere origin on the line)
1136 impactdist = DotProduct(sphereorigin, dir) - DotProduct(linestart, dir);
1137 // calculate point on line at that distance, and subtract the
1138 // sphereorigin from it, so we have a vector to measure for the distance
1139 // of the line from the sphereorigin (deviation, how off-center it is)
1140 VectorMA(linestart, impactdist, dir, v);
1141 VectorSubtract(v, sphereorigin, v);
1142 deviationdist = VectorLength2(v);
1143 // if outside the radius, it's a miss for sure
1144 // (we do this comparison using squared radius to avoid a sqrt)
1145 if (deviationdist > sphereradius*sphereradius)
1146 return 1; // miss (off to the side)
1147 // nudge back to find the correct impact distance
1148 impactdist += deviationdist - sphereradius;
1149 if (impactdist >= linelength)
1150 return 1; // miss (not close enough)
1152 return 1; // miss (linestart is past or inside sphere)
1153 // calculate new impactpoint
1154 VectorMA(linestart, impactdist, dir, impactpoint);
1155 // calculate impactnormal (surface normal at point of impact)
1156 VectorSubtract(impactpoint, sphereorigin, impactnormal);
1157 // normalize impactnormal
1158 VectorNormalize(impactnormal);
1159 // return fraction of movement distance
1160 return impactdist / linelength;
1163 void Collision_TraceLineTriangleFloat(trace_t *trace, const vec3_t linestart, const vec3_t lineend, const float *point0, const float *point1, const float *point2, int supercontents, int q3surfaceflags, texture_t *texture)
1167 float d1, d2, d, f, impact[3], edgenormal[3], faceplanenormal[3], faceplanedist, faceplanenormallength2, edge01[3], edge21[3], edge02[3];
1169 // this function executes:
1170 // 32 ops when line starts behind triangle
1171 // 38 ops when line ends infront of triangle
1172 // 43 ops when line fraction is already closer than this triangle
1173 // 72 ops when line is outside edge 01
1174 // 92 ops when line is outside edge 21
1175 // 115 ops when line is outside edge 02
1176 // 123 ops when line impacts triangle and updates trace results
1178 // this code is designed for clockwise triangles, conversion to
1179 // counterclockwise would require swapping some things around...
1180 // it is easier to simply swap the point0 and point2 parameters to this
1181 // function when calling it than it is to rewire the internals.
1183 // calculate the faceplanenormal of the triangle, this represents the front side
1185 VectorSubtract(point0, point1, edge01);
1186 VectorSubtract(point2, point1, edge21);
1187 CrossProduct(edge01, edge21, faceplanenormal);
1188 // there's no point in processing a degenerate triangle (GIGO - Garbage In, Garbage Out)
1190 faceplanenormallength2 = DotProduct(faceplanenormal, faceplanenormal);
1191 if (faceplanenormallength2 < 0.0001f)
1193 // calculate the distance
1195 faceplanedist = DotProduct(point0, faceplanenormal);
1197 // if start point is on the back side there is no collision
1198 // (we don't care about traces going through the triangle the wrong way)
1200 // calculate the start distance
1202 d1 = DotProduct(faceplanenormal, linestart);
1203 if (d1 <= faceplanedist)
1206 // calculate the end distance
1208 d2 = DotProduct(faceplanenormal, lineend);
1209 // if both are in front, there is no collision
1210 if (d2 >= faceplanedist)
1213 // from here on we know d1 is >= 0 and d2 is < 0
1214 // this means the line starts infront and ends behind, passing through it
1216 // calculate the recipricol of the distance delta,
1217 // so we can use it multiple times cheaply (instead of division)
1219 d = 1.0f / (d1 - d2);
1220 // calculate the impact fraction by taking the start distance (> 0)
1221 // and subtracting the face plane distance (this is the distance of the
1222 // triangle along that same normal)
1223 // then multiply by the recipricol distance delta
1225 f = (d1 - faceplanedist) * d;
1226 // skip out if this impact is further away than previous ones
1228 if (f > trace->realfraction)
1230 // calculate the perfect impact point for classification of insidedness
1232 impact[0] = linestart[0] + f * (lineend[0] - linestart[0]);
1233 impact[1] = linestart[1] + f * (lineend[1] - linestart[1]);
1234 impact[2] = linestart[2] + f * (lineend[2] - linestart[2]);
1236 // calculate the edge normal and reject if impact is outside triangle
1237 // (an edge normal faces away from the triangle, to get the desired normal
1238 // a crossproduct with the faceplanenormal is used, and because of the way
1239 // the insidedness comparison is written it does not need to be normalized)
1241 // first use the two edges from the triangle plane math
1242 // the other edge only gets calculated if the point survives that long
1245 CrossProduct(edge01, faceplanenormal, edgenormal);
1246 if (DotProduct(impact, edgenormal) > DotProduct(point1, edgenormal))
1250 CrossProduct(faceplanenormal, edge21, edgenormal);
1251 if (DotProduct(impact, edgenormal) > DotProduct(point2, edgenormal))
1255 VectorSubtract(point0, point2, edge02);
1256 CrossProduct(faceplanenormal, edge02, edgenormal);
1257 if (DotProduct(impact, edgenormal) > DotProduct(point0, edgenormal))
1262 // store the new trace fraction
1263 trace->realfraction = f;
1265 // calculate a nudged fraction to keep it out of the surface
1266 // (the main fraction remains perfect)
1267 trace->fraction = f - collision_impactnudge.value * d;
1269 if (collision_prefernudgedfraction.integer)
1270 trace->realfraction = trace->fraction;
1272 // store the new trace plane (because collisions only happen from
1273 // the front this is always simply the triangle normal, never flipped)
1274 d = 1.0 / sqrt(faceplanenormallength2);
1275 VectorScale(faceplanenormal, d, trace->plane.normal);
1276 trace->plane.dist = faceplanedist * d;
1278 trace->hitsupercontents = supercontents;
1279 trace->hitq3surfaceflags = q3surfaceflags;
1280 trace->hittexture = texture;
1282 float d1, d2, d, f, fnudged, impact[3], edgenormal[3], faceplanenormal[3], faceplanedist, edge[3];
1284 // this code is designed for clockwise triangles, conversion to
1285 // counterclockwise would require swapping some things around...
1286 // it is easier to simply swap the point0 and point2 parameters to this
1287 // function when calling it than it is to rewire the internals.
1289 // calculate the unnormalized faceplanenormal of the triangle,
1290 // this represents the front side
1291 TriangleNormal(point0, point1, point2, faceplanenormal);
1292 // there's no point in processing a degenerate triangle
1293 // (GIGO - Garbage In, Garbage Out)
1294 if (DotProduct(faceplanenormal, faceplanenormal) < 0.0001f)
1296 // calculate the unnormalized distance
1297 faceplanedist = DotProduct(point0, faceplanenormal);
1299 // calculate the unnormalized start distance
1300 d1 = DotProduct(faceplanenormal, linestart) - faceplanedist;
1301 // if start point is on the back side there is no collision
1302 // (we don't care about traces going through the triangle the wrong way)
1306 // calculate the unnormalized end distance
1307 d2 = DotProduct(faceplanenormal, lineend) - faceplanedist;
1308 // if both are in front, there is no collision
1312 // from here on we know d1 is >= 0 and d2 is < 0
1313 // this means the line starts infront and ends behind, passing through it
1315 // calculate the recipricol of the distance delta,
1316 // so we can use it multiple times cheaply (instead of division)
1317 d = 1.0f / (d1 - d2);
1318 // calculate the impact fraction by taking the start distance (> 0)
1319 // and subtracting the face plane distance (this is the distance of the
1320 // triangle along that same normal)
1321 // then multiply by the recipricol distance delta
1323 // skip out if this impact is further away than previous ones
1324 if (f > trace->realfraction)
1326 // calculate the perfect impact point for classification of insidedness
1327 impact[0] = linestart[0] + f * (lineend[0] - linestart[0]);
1328 impact[1] = linestart[1] + f * (lineend[1] - linestart[1]);
1329 impact[2] = linestart[2] + f * (lineend[2] - linestart[2]);
1331 // calculate the edge normal and reject if impact is outside triangle
1332 // (an edge normal faces away from the triangle, to get the desired normal
1333 // a crossproduct with the faceplanenormal is used, and because of the way
1334 // the insidedness comparison is written it does not need to be normalized)
1336 VectorSubtract(point2, point0, edge);
1337 CrossProduct(edge, faceplanenormal, edgenormal);
1338 if (DotProduct(impact, edgenormal) > DotProduct(point0, edgenormal))
1341 VectorSubtract(point0, point1, edge);
1342 CrossProduct(edge, faceplanenormal, edgenormal);
1343 if (DotProduct(impact, edgenormal) > DotProduct(point1, edgenormal))
1346 VectorSubtract(point1, point2, edge);
1347 CrossProduct(edge, faceplanenormal, edgenormal);
1348 if (DotProduct(impact, edgenormal) > DotProduct(point2, edgenormal))
1351 // store the new trace fraction
1352 trace->realfraction = bound(0, f, 1);
1354 // store the new trace plane (because collisions only happen from
1355 // the front this is always simply the triangle normal, never flipped)
1356 VectorNormalize(faceplanenormal);
1357 VectorCopy(faceplanenormal, trace->plane.normal);
1358 trace->plane.dist = DotProduct(point0, faceplanenormal);
1360 // calculate the normalized start and end distances
1361 d1 = DotProduct(trace->plane.normal, linestart) - trace->plane.dist;
1362 d2 = DotProduct(trace->plane.normal, lineend) - trace->plane.dist;
1364 // calculate a nudged fraction to keep it out of the surface
1365 // (the main fraction remains perfect)
1366 fnudged = (d1 - collision_impactnudge.value) / (d1 - d2);
1367 trace->fraction = bound(0, fnudged, 1);
1369 // store the new trace endpos
1370 // not needed, it's calculated later when the trace is finished
1371 //trace->endpos[0] = linestart[0] + fnudged * (lineend[0] - linestart[0]);
1372 //trace->endpos[1] = linestart[1] + fnudged * (lineend[1] - linestart[1]);
1373 //trace->endpos[2] = linestart[2] + fnudged * (lineend[2] - linestart[2]);
1374 trace->hitsupercontents = supercontents;
1375 trace->hitq3surfaceflags = q3surfaceflags;
1376 trace->hittexture = texture;
1380 typedef struct colbspnode_s
1383 struct colbspnode_s *children[2];
1384 // the node is reallocated or split if max is reached
1387 colbrushf_t **colbrushflist;
1390 //colbrushd_t **colbrushdlist;
1394 typedef struct colbsp_s
1397 colbspnode_t *nodes;
1401 colbsp_t *Collision_CreateCollisionBSP(mempool_t *mempool)
1404 bsp = (colbsp_t *)Mem_Alloc(mempool, sizeof(colbsp_t));
1405 bsp->mempool = mempool;
1406 bsp->nodes = (colbspnode_t *)Mem_Alloc(bsp->mempool, sizeof(colbspnode_t));
1410 void Collision_FreeCollisionBSPNode(colbspnode_t *node)
1412 if (node->children[0])
1413 Collision_FreeCollisionBSPNode(node->children[0]);
1414 if (node->children[1])
1415 Collision_FreeCollisionBSPNode(node->children[1]);
1416 while (--node->numcolbrushf)
1417 Mem_Free(node->colbrushflist[node->numcolbrushf]);
1418 //while (--node->numcolbrushd)
1419 // Mem_Free(node->colbrushdlist[node->numcolbrushd]);
1423 void Collision_FreeCollisionBSP(colbsp_t *bsp)
1425 Collision_FreeCollisionBSPNode(bsp->nodes);
1429 void Collision_BoundingBoxOfBrushTraceSegment(const colbrushf_t *start, const colbrushf_t *end, vec3_t mins, vec3_t maxs, float startfrac, float endfrac)
1432 colpointf_t *ps, *pe;
1433 float tempstart[3], tempend[3];
1434 VectorLerp(start->points[0].v, startfrac, end->points[0].v, mins);
1435 VectorCopy(mins, maxs);
1436 for (i = 0, ps = start->points, pe = end->points;i < start->numpoints;i++, ps++, pe++)
1438 VectorLerp(ps->v, startfrac, pe->v, tempstart);
1439 VectorLerp(ps->v, endfrac, pe->v, tempend);
1440 mins[0] = min(mins[0], min(tempstart[0], tempend[0]));
1441 mins[1] = min(mins[1], min(tempstart[1], tempend[1]));
1442 mins[2] = min(mins[2], min(tempstart[2], tempend[2]));
1443 maxs[0] = min(maxs[0], min(tempstart[0], tempend[0]));
1444 maxs[1] = min(maxs[1], min(tempstart[1], tempend[1]));
1445 maxs[2] = min(maxs[2], min(tempstart[2], tempend[2]));