2 Copyright (C) 1999-2007 id Software, Inc. and contributors.
3 For a list of contributors, see the accompanying CONTRIBUTORS file.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
29 extern int numthreads;
31 // counters are only bumped when running single threaded,
32 // because they are an awefull coherence problem
33 int c_active_windings;
38 #define BOGUS_RANGE 8192
43 for (i=0 ; i<w->numpoints ; i++)
44 printf ("(%5.1f, %5.1f, %5.1f)\n",w->p[i][0], w->p[i][1],w->p[i][2]);
53 winding_t *AllocWinding (int points)
61 c_winding_points += points;
63 if (c_active_windings > c_peak_windings)
64 c_peak_windings = c_active_windings;
66 s = sizeof(vec_t)*3*points + sizeof(int);
69 Error("AllocWinding MALLOC failed! Could not allocate %s bytes.", s);
74 void FreeWinding (winding_t *w)
76 if (*(unsigned *)w == 0xdeaddead)
77 Error ("FreeWinding: freed a freed winding");
78 *(unsigned *)w = 0xdeaddead;
92 void RemoveColinearPoints (winding_t *w)
97 vec3_t p[MAX_POINTS_ON_WINDING];
100 for (i=0 ; i<w->numpoints ; i++)
102 j = (i+1)%w->numpoints;
103 k = (i+w->numpoints-1)%w->numpoints;
104 VectorSubtract (w->p[j], w->p[i], v1);
105 VectorSubtract (w->p[i], w->p[k], v2);
106 VectorNormalize(v1,v1);
107 VectorNormalize(v2,v2);
108 if (DotProduct(v1, v2) < 0.999)
110 VectorCopy (w->p[i], p[nump]);
115 if (nump == w->numpoints)
119 c_removed += w->numpoints - nump;
121 memcpy (w->p, p, nump*sizeof(p[0]));
129 void WindingPlane (winding_t *w, vec3_t normal, vec_t *dist)
133 VectorSubtract (w->p[1], w->p[0], v1);
134 VectorSubtract (w->p[2], w->p[0], v2);
135 CrossProduct (v2, v1, normal);
136 VectorNormalize (normal, normal);
137 *dist = DotProduct (w->p[0], normal);
146 vec_t WindingArea (winding_t *w)
149 vec3_t d1, d2, cross;
153 for (i=2 ; i<w->numpoints ; i++)
155 VectorSubtract (w->p[i-1], w->p[0], d1);
156 VectorSubtract (w->p[i], w->p[0], d2);
157 CrossProduct (d1, d2, cross);
158 total += 0.5 * VectorLength ( cross );
163 void WindingBounds (winding_t *w, vec3_t mins, vec3_t maxs)
168 mins[0] = mins[1] = mins[2] = 99999;
169 maxs[0] = maxs[1] = maxs[2] = -99999;
171 for (i=0 ; i<w->numpoints ; i++)
173 for (j=0 ; j<3 ; j++)
189 void WindingCenter (winding_t *w, vec3_t center)
194 VectorCopy (vec3_origin, center);
195 for (i=0 ; i<w->numpoints ; i++)
196 VectorAdd (w->p[i], center, center);
198 scale = 1.0/w->numpoints;
199 VectorScale (center, scale, center);
207 winding_t *BaseWindingForPlane (vec3_t normal, vec_t dist)
211 vec3_t org, vright, vup;
214 // find the major axis
228 Error ("BaseWindingForPlane: no axis found");
230 VectorCopy (vec3_origin, vup);
242 v = DotProduct (vup, normal);
243 VectorMA (vup, -v, normal, vup);
244 VectorNormalize (vup, vup);
246 VectorScale (normal, dist, org);
248 CrossProduct (vup, normal, vright);
250 VectorScale (vup, 8192, vup);
251 VectorScale (vright, 8192, vright);
253 // project a really big axis aligned box onto the plane
254 w = AllocWinding (4);
256 VectorSubtract (org, vright, w->p[0]);
257 VectorAdd (w->p[0], vup, w->p[0]);
259 VectorAdd (org, vright, w->p[1]);
260 VectorAdd (w->p[1], vup, w->p[1]);
262 VectorAdd (org, vright, w->p[2]);
263 VectorSubtract (w->p[2], vup, w->p[2]);
265 VectorSubtract (org, vright, w->p[3]);
266 VectorSubtract (w->p[3], vup, w->p[3]);
278 winding_t *CopyWinding (winding_t *w)
283 c = AllocWinding (w->numpoints);
284 size = (int)((winding_t *)0)->p[w->numpoints];
294 winding_t *ReverseWinding (winding_t *w)
299 c = AllocWinding (w->numpoints);
300 for (i=0 ; i<w->numpoints ; i++)
302 VectorCopy (w->p[w->numpoints-1-i], c->p[i]);
304 c->numpoints = w->numpoints;
314 void ClipWindingEpsilon (winding_t *in, vec3_t normal, vec_t dist,
315 vec_t epsilon, winding_t **front, winding_t **back)
317 vec_t dists[MAX_POINTS_ON_WINDING+4];
318 int sides[MAX_POINTS_ON_WINDING+4];
320 vec_t dot; // VC 4.2 optimizer bug if not static
327 if (in->numpoints >= MAX_POINTS_ON_WINDING-4)
328 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
330 counts[0] = counts[1] = counts[2] = 0;
332 // determine sides for each point
333 for (i=0 ; i<in->numpoints ; i++)
335 dot = DotProduct (in->p[i], normal);
339 sides[i] = SIDE_FRONT;
340 else if (dot < -epsilon)
341 sides[i] = SIDE_BACK;
351 *front = *back = NULL;
355 *back = CopyWinding (in);
360 *front = CopyWinding (in);
364 maxpts = in->numpoints+4; // cant use counts[0]+2 because
365 // of fp grouping errors
367 *front = f = AllocWinding (maxpts);
368 *back = b = AllocWinding (maxpts);
370 for (i=0 ; i<in->numpoints ; i++)
374 if (sides[i] == SIDE_ON)
376 VectorCopy (p1, f->p[f->numpoints]);
378 VectorCopy (p1, b->p[b->numpoints]);
383 if (sides[i] == SIDE_FRONT)
385 VectorCopy (p1, f->p[f->numpoints]);
388 if (sides[i] == SIDE_BACK)
390 VectorCopy (p1, b->p[b->numpoints]);
394 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
397 // generate a split point
398 p2 = in->p[(i+1)%in->numpoints];
400 dot = dists[i] / (dists[i]-dists[i+1]);
401 for (j=0 ; j<3 ; j++)
402 { // avoid round off error when possible
405 else if (normal[j] == -1)
408 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
411 VectorCopy (mid, f->p[f->numpoints]);
413 VectorCopy (mid, b->p[b->numpoints]);
417 if (f->numpoints > maxpts || b->numpoints > maxpts)
418 Error ("ClipWinding: points exceeded estimate");
419 if (f->numpoints > MAX_POINTS_ON_WINDING || b->numpoints > MAX_POINTS_ON_WINDING)
420 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
429 void ChopWindingInPlace (winding_t **inout, vec3_t normal, vec_t dist, vec_t epsilon)
432 vec_t dists[MAX_POINTS_ON_WINDING+4];
433 int sides[MAX_POINTS_ON_WINDING+4];
435 vec_t dot; // VC 4.2 optimizer bug if not static
443 counts[0] = counts[1] = counts[2] = 0;
447 printf ("Warning: NULL passed to ChopWindingInPlace\n");
450 if (in->numpoints >= MAX_POINTS_ON_WINDING-4)
451 Error ("ChopWinding: MAX_POINTS_ON_WINDING");
453 // determine sides for each point
454 for (i=0 ; i<in->numpoints ; i++)
456 dot = DotProduct (in->p[i], normal);
460 sides[i] = SIDE_FRONT;
461 else if (dot < -epsilon)
462 sides[i] = SIDE_BACK;
479 return; // inout stays the same
481 maxpts = in->numpoints+4; // cant use counts[0]+2 because
482 // of fp grouping errors
484 f = AllocWinding (maxpts);
486 for (i=0 ; i<in->numpoints ; i++)
490 if (sides[i] == SIDE_ON)
492 VectorCopy (p1, f->p[f->numpoints]);
497 if (sides[i] == SIDE_FRONT)
499 VectorCopy (p1, f->p[f->numpoints]);
503 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
506 // generate a split point
507 p2 = in->p[(i+1)%in->numpoints];
509 dot = dists[i] / (dists[i]-dists[i+1]);
510 for (j=0 ; j<3 ; j++)
511 { // avoid round off error when possible
514 else if (normal[j] == -1)
517 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
520 VectorCopy (mid, f->p[f->numpoints]);
524 if (f->numpoints > maxpts)
525 Error ("ClipWinding: points exceeded estimate");
526 if (f->numpoints > MAX_POINTS_ON_WINDING)
527 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
538 Returns the fragment of in that is on the front side
539 of the cliping plane. The original is freed.
542 winding_t *ChopWinding (winding_t *in, vec3_t normal, vec_t dist)
546 ClipWindingEpsilon (in, normal, dist, ON_EPSILON, &f, &b);
560 void CheckWinding (winding_t *w)
565 vec3_t dir, edgenormal, facenormal;
569 if (w->numpoints < 3)
570 Error ("CheckWinding: %i points",w->numpoints);
572 area = WindingArea(w);
574 Error ("CheckWinding: %f area", area);
576 WindingPlane (w, facenormal, &facedist);
578 for (i=0 ; i<w->numpoints ; i++)
582 for (j=0 ; j<3 ; j++)
583 if (p1[j] > BOGUS_RANGE || p1[j] < -BOGUS_RANGE)
584 Error ("CheckFace: BUGUS_RANGE: %f",p1[j]);
586 j = i+1 == w->numpoints ? 0 : i+1;
588 // check the point is on the face plane
589 d = DotProduct (p1, facenormal) - facedist;
590 if (d < -ON_EPSILON || d > ON_EPSILON)
591 Error ("CheckWinding: point off plane");
593 // check the edge isnt degenerate
595 VectorSubtract (p2, p1, dir);
597 if (VectorLength (dir) < ON_EPSILON)
598 Error ("CheckWinding: degenerate edge");
600 CrossProduct (facenormal, dir, edgenormal);
601 VectorNormalize (edgenormal, edgenormal);
602 edgedist = DotProduct (p1, edgenormal);
603 edgedist += ON_EPSILON;
605 // all other points must be on front side
606 for (j=0 ; j<w->numpoints ; j++)
610 d = DotProduct (w->p[j], edgenormal);
612 Error ("CheckWinding: non-convex");
623 int WindingOnPlaneSide (winding_t *w, vec3_t normal, vec_t dist)
625 qboolean front, back;
631 for (i=0 ; i<w->numpoints ; i++)
633 d = DotProduct (w->p[i], normal) - dist;