--- /dev/null
+
+#include "quakedef.h"
+#include "winding.h"
+
+// this code came from qbsp source
+
+#define MAX_POINTS_ON_WINDING 64
+
+winding_t *Winding_New(int points)
+{
+ winding_t *w;
+ int size;
+
+ if (points > MAX_POINTS_ON_WINDING)
+ Sys_Error("Winding_New: too many points\n");
+
+ size = sizeof(winding_t) + sizeof(double[3]) * (points - 8);
+ w = Mem_Alloc(loadmodel->mempool, size);
+ //Mem_Alloc clears
+ //memset(w, 0, size);
+
+ return w;
+}
+
+void Winding_Free(winding_t *w)
+{
+ Mem_Free(w);
+}
+
+winding_t *Winding_NewFromPlane(double normalx, double normaly, double normalz, double dist)
+{
+ int x;
+ double max, v, org[3], vright[3], vup[3], normal[3];
+ winding_t *w;
+
+ normal[0] = normalx;
+ normal[1] = normaly;
+ normal[2] = normalz;
+#if 0
+ VectorVectorsDouble(normal, vright, vup);
+#else
+ // find the major axis
+ x = 0;
+ max = fabs(normal[0]);
+ v = fabs(normal[1]);
+ if(v > max)
+ {
+ x = 1;
+ max = v;
+ }
+ v = fabs(normal[2]);
+ if(v > max)
+ {
+ x = 2;
+ max = v;
+ }
+
+ VectorClear(vup);
+ switch(x)
+ {
+ case 0:
+ case 1:
+ vup[2] = 1;
+ break;
+ case 2:
+ vup[0] = 1;
+ break;
+ }
+
+ v = DotProduct(vup, normal);
+ VectorMA(vup, -v, normal, vup);
+ VectorNormalize(vup);
+#endif
+
+ VectorScale(normal, dist, org);
+
+ CrossProduct(vup, normal, vright);
+
+ VectorScale(vup, 1024.0*1024.0*1024.0, vup);
+ VectorScale(vright, 1024.0*1024.0*1024.0, vright);
+
+ // project a really big axis aligned box onto the plane
+ w = Winding_New(4);
+
+ VectorSubtract(org, vright, w->points[0]);
+ VectorAdd(w->points[0], vup, w->points[0]);
+
+ VectorAdd(org, vright, w->points[1]);
+ VectorAdd(w->points[1], vup, w->points[1]);
+
+ VectorAdd(org, vright, w->points[2]);
+ VectorSubtract(w->points[2], vup, w->points[2]);
+
+ VectorSubtract(org, vright, w->points[3]);
+ VectorSubtract(w->points[3], vup, w->points[3]);
+
+ w->numpoints = 4;
+
+ return w;
+}
+
+//Clips the winding to the plane, returning the new winding on the positive side
+//Frees the input winding.
+//If keepon is true, an exactly on-plane winding will be saved, otherwise
+//it will be clipped away.
+winding_t *Winding_Clip(winding_t *in, double splitnormalx, double splitnormaly, double splitnormalz, double splitdist, int keepon)
+{
+ winding_t *neww;
+ double dot, *p1, *p2, mid[3], splitnormal[3], dists[MAX_POINTS_ON_WINDING + 1];
+ int i, j, maxpts, counts[3], sides[MAX_POINTS_ON_WINDING + 1];
+
+ splitnormal[0] = splitnormalx;
+ splitnormal[1] = splitnormaly;
+ splitnormal[2] = splitnormalz;
+ counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
+
+ // determine sides for each point
+ for (i = 0;i < in->numpoints;i++)
+ {
+ dists[i] = dot = DotProduct(in->points[i], splitnormal) - splitdist;
+ if (dot > ON_EPSILON)
+ sides[i] = SIDE_FRONT;
+ else if (dot < -ON_EPSILON)
+ sides[i] = SIDE_BACK;
+ else
+ sides[i] = SIDE_ON;
+ counts[sides[i]]++;
+ }
+ sides[i] = sides[0];
+ dists[i] = dists[0];
+
+ if (keepon && !counts[0] && !counts[1])
+ return in;
+
+ if (!counts[0])
+ {
+ Winding_Free(in);
+ return NULL;
+ }
+ if (!counts[1])
+ return in;
+
+ maxpts = in->numpoints+4; // can't use counts[0]+2 because of fp grouping errors
+ if (maxpts > MAX_POINTS_ON_WINDING)
+ Sys_Error("Winding_Clip: maxpts > MAX_POINTS_ON_WINDING");
+
+ neww = Winding_New(maxpts);
+
+ for (i = 0;i < in->numpoints;i++)
+ {
+ if (neww->numpoints >= maxpts)
+ Sys_Error("Winding_Clip: points exceeded estimate");
+
+ p1 = in->points[i];
+
+ if (sides[i] == SIDE_ON)
+ {
+ VectorCopy(p1, neww->points[neww->numpoints]);
+ neww->numpoints++;
+ continue;
+ }
+
+ if (sides[i] == SIDE_FRONT)
+ {
+ VectorCopy(p1, neww->points[neww->numpoints]);
+ neww->numpoints++;
+ }
+
+ if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
+ continue;
+
+ // generate a split point
+ p2 = in->points[(i+1)%in->numpoints];
+
+ dot = dists[i] / (dists[i]-dists[i+1]);
+ for (j = 0;j < 3;j++)
+ { // avoid round off error when possible
+ if (splitnormal[j] == 1)
+ mid[j] = splitdist;
+ else if (splitnormal[j] == -1)
+ mid[j] = -splitdist;
+ else
+ mid[j] = p1[j] + dot* (p2[j]-p1[j]);
+ }
+
+ VectorCopy(mid, neww->points[neww->numpoints]);
+ neww->numpoints++;
+ }
+
+ // free the original winding
+ Winding_Free(in);
+
+ return neww;
+}
+
+
+//Divides a winding by a plane, producing one or two windings. The
+//original winding is not damaged or freed. If only on one side, the
+//returned winding will be the input winding. If on both sides, two
+//new windings will be created.
+void Winding_Divide(winding_t *in, double splitnormalx, double splitnormaly, double splitnormalz, double splitdist, winding_t **front, winding_t **back)
+{
+ winding_t *f, *b;
+ double dot, *p1, *p2, mid[3], splitnormal[3], dists[MAX_POINTS_ON_WINDING + 1];
+ int i, j, maxpts, counts[3], sides[MAX_POINTS_ON_WINDING + 1];
+
+ splitnormal[0] = splitnormalx;
+ splitnormal[1] = splitnormaly;
+ splitnormal[2] = splitnormalz;
+
+ counts[SIDE_FRONT] = counts[SIDE_BACK] = counts[SIDE_ON] = 0;
+
+ // determine sides for each point
+ for (i = 0;i < in->numpoints;i++)
+ {
+ dot = DotProduct(in->points[i], splitnormal);
+ dot -= splitdist;
+ dists[i] = dot;
+ if (dot > ON_EPSILON) sides[i] = SIDE_FRONT;
+ else if (dot < -ON_EPSILON) sides[i] = SIDE_BACK;
+ else sides[i] = SIDE_ON;
+ counts[sides[i]]++;
+ }
+ sides[i] = sides[0];
+ dists[i] = dists[0];
+
+ *front = *back = NULL;
+
+ if (!counts[0])
+ {
+ *back = in;
+ return;
+ }
+ if (!counts[1])
+ {
+ *front = in;
+ return;
+ }
+
+ maxpts = in->numpoints+4; // can't use counts[0]+2 because of fp grouping errors
+
+ if (maxpts > MAX_POINTS_ON_WINDING)
+ Sys_Error("Winding_Clip: maxpts > MAX_POINTS_ON_WINDING");
+
+ *front = f = Winding_New(maxpts);
+ *back = b = Winding_New(maxpts);
+
+ for (i = 0;i < in->numpoints;i++)
+ {
+ if (f->numpoints >= maxpts || b->numpoints >= maxpts)
+ Sys_Error("Winding_Divide: points exceeded estimate");
+
+ p1 = in->points[i];
+
+ if (sides[i] == SIDE_ON)
+ {
+ VectorCopy(p1, f->points[f->numpoints]);
+ f->numpoints++;
+ VectorCopy(p1, b->points[b->numpoints]);
+ b->numpoints++;
+ continue;
+ }
+
+ if (sides[i] == SIDE_FRONT)
+ {
+ VectorCopy(p1, f->points[f->numpoints]);
+ f->numpoints++;
+ }
+ else if (sides[i] == SIDE_BACK)
+ {
+ VectorCopy(p1, b->points[b->numpoints]);
+ b->numpoints++;
+ }
+
+ if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
+ continue;
+
+ // generate a split point
+ p2 = in->points[(i+1)%in->numpoints];
+
+ dot = dists[i] / (dists[i]-dists[i+1]);
+ for (j = 0;j < 3;j++)
+ { // avoid round off error when possible
+ if (splitnormal[j] == 1)
+ mid[j] = splitdist;
+ else if (splitnormal[j] == -1)
+ mid[j] = -splitdist;
+ else
+ mid[j] = p1[j] + dot* (p2[j]-p1[j]);
+ }
+
+ VectorCopy(mid, f->points[f->numpoints]);
+ f->numpoints++;
+ VectorCopy(mid, b->points[b->numpoints]);
+ b->numpoints++;
+ }
+}
+
+