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