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
24 #include "mathlib.h"
\r
25 #include "polylib.h"
\r
28 extern int numthreads;
\r
30 // counters are only bumped when running single threaded,
\r
31 // because they are an awefull coherence problem
\r
32 int c_active_windings;
\r
33 int c_peak_windings;
\r
34 int c_winding_allocs;
\r
35 int c_winding_points;
\r
37 #define BOGUS_RANGE 8192
\r
39 void pw(winding_t *w)
\r
42 for (i=0 ; i<w->numpoints ; i++)
\r
43 printf ("(%5.1f, %5.1f, %5.1f)\n",w->p[i][0], w->p[i][1],w->p[i][2]);
\r
52 winding_t *AllocWinding (int points)
\r
57 if (numthreads == 1)
\r
60 c_winding_points += points;
\r
61 c_active_windings++;
\r
62 if (c_active_windings > c_peak_windings)
\r
63 c_peak_windings = c_active_windings;
\r
65 s = sizeof(vec_t)*3*points + sizeof(int);
\r
71 void FreeWinding (winding_t *w)
\r
73 if (*(unsigned *)w == 0xdeaddead)
\r
74 Error ("FreeWinding: freed a freed winding");
\r
75 *(unsigned *)w = 0xdeaddead;
\r
77 if (numthreads == 1)
\r
78 c_active_windings--;
\r
84 RemoveColinearPoints
\r
89 void RemoveColinearPoints (winding_t *w)
\r
94 vec3_t p[MAX_POINTS_ON_WINDING];
\r
97 for (i=0 ; i<w->numpoints ; i++)
\r
99 j = (i+1)%w->numpoints;
\r
100 k = (i+w->numpoints-1)%w->numpoints;
\r
101 VectorSubtract (w->p[j], w->p[i], v1);
\r
102 VectorSubtract (w->p[i], w->p[k], v2);
\r
103 VectorNormalize(v1,v1);
\r
104 VectorNormalize(v2,v2);
\r
105 if (DotProduct(v1, v2) < 0.999)
\r
107 VectorCopy (w->p[i], p[nump]);
\r
112 if (nump == w->numpoints)
\r
115 if (numthreads == 1)
\r
116 c_removed += w->numpoints - nump;
\r
117 w->numpoints = nump;
\r
118 memcpy (w->p, p, nump*sizeof(p[0]));
\r
126 void WindingPlane (winding_t *w, vec3_t normal, vec_t *dist)
\r
130 VectorSubtract (w->p[1], w->p[0], v1);
\r
131 VectorSubtract (w->p[2], w->p[0], v2);
\r
132 CrossProduct (v2, v1, normal);
\r
133 VectorNormalize (normal, normal);
\r
134 *dist = DotProduct (w->p[0], normal);
\r
143 vec_t WindingArea (winding_t *w)
\r
146 vec3_t d1, d2, cross;
\r
150 for (i=2 ; i<w->numpoints ; i++)
\r
152 VectorSubtract (w->p[i-1], w->p[0], d1);
\r
153 VectorSubtract (w->p[i], w->p[0], d2);
\r
154 CrossProduct (d1, d2, cross);
\r
155 total += 0.5 * VectorLength ( cross );
\r
160 void WindingBounds (winding_t *w, vec3_t mins, vec3_t maxs)
\r
165 mins[0] = mins[1] = mins[2] = 99999;
\r
166 maxs[0] = maxs[1] = maxs[2] = -99999;
\r
168 for (i=0 ; i<w->numpoints ; i++)
\r
170 for (j=0 ; j<3 ; j++)
\r
186 void WindingCenter (winding_t *w, vec3_t center)
\r
191 VectorCopy (vec3_origin, center);
\r
192 for (i=0 ; i<w->numpoints ; i++)
\r
193 VectorAdd (w->p[i], center, center);
\r
195 scale = 1.0/w->numpoints;
\r
196 VectorScale (center, scale, center);
\r
201 BaseWindingForPlane
\r
204 winding_t *BaseWindingForPlane (vec3_t normal, vec_t dist)
\r
208 vec3_t org, vright, vup;
\r
211 // find the major axis
\r
213 max = -BOGUS_RANGE;
\r
215 for (i=0 ; i<3; i++)
\r
217 v = fabs(normal[i]);
\r
225 Error ("BaseWindingForPlane: no axis found");
\r
227 VectorCopy (vec3_origin, vup);
\r
239 v = DotProduct (vup, normal);
\r
240 VectorMA (vup, -v, normal, vup);
\r
241 VectorNormalize (vup, vup);
\r
243 VectorScale (normal, dist, org);
\r
245 CrossProduct (vup, normal, vright);
\r
247 VectorScale (vup, 8192, vup);
\r
248 VectorScale (vright, 8192, vright);
\r
250 // project a really big axis aligned box onto the plane
\r
251 w = AllocWinding (4);
\r
253 VectorSubtract (org, vright, w->p[0]);
\r
254 VectorAdd (w->p[0], vup, w->p[0]);
\r
256 VectorAdd (org, vright, w->p[1]);
\r
257 VectorAdd (w->p[1], vup, w->p[1]);
\r
259 VectorAdd (org, vright, w->p[2]);
\r
260 VectorSubtract (w->p[2], vup, w->p[2]);
\r
262 VectorSubtract (org, vright, w->p[3]);
\r
263 VectorSubtract (w->p[3], vup, w->p[3]);
\r
275 winding_t *CopyWinding (winding_t *w)
\r
280 c = AllocWinding (w->numpoints);
\r
281 size = (int)((winding_t *)0)->p[w->numpoints];
\r
282 memcpy (c, w, size);
\r
291 winding_t *ReverseWinding (winding_t *w)
\r
296 c = AllocWinding (w->numpoints);
\r
297 for (i=0 ; i<w->numpoints ; i++)
\r
299 VectorCopy (w->p[w->numpoints-1-i], c->p[i]);
\r
301 c->numpoints = w->numpoints;
\r
311 void ClipWindingEpsilon (winding_t *in, vec3_t normal, vec_t dist,
\r
312 vec_t epsilon, winding_t **front, winding_t **back)
\r
314 vec_t dists[MAX_POINTS_ON_WINDING+4];
\r
315 int sides[MAX_POINTS_ON_WINDING+4];
\r
317 static vec_t dot; // VC 4.2 optimizer bug if not static
\r
324 counts[0] = counts[1] = counts[2] = 0;
\r
326 // determine sides for each point
\r
327 for (i=0 ; i<in->numpoints ; i++)
\r
329 dot = DotProduct (in->p[i], normal);
\r
333 sides[i] = SIDE_FRONT;
\r
334 else if (dot < -epsilon)
\r
335 sides[i] = SIDE_BACK;
\r
338 sides[i] = SIDE_ON;
\r
340 counts[sides[i]]++;
\r
342 sides[i] = sides[0];
\r
343 dists[i] = dists[0];
\r
345 *front = *back = NULL;
\r
349 *back = CopyWinding (in);
\r
354 *front = CopyWinding (in);
\r
358 maxpts = in->numpoints+4; // cant use counts[0]+2 because
\r
359 // of fp grouping errors
\r
361 *front = f = AllocWinding (maxpts);
\r
362 *back = b = AllocWinding (maxpts);
\r
364 for (i=0 ; i<in->numpoints ; i++)
\r
368 if (sides[i] == SIDE_ON)
\r
370 VectorCopy (p1, f->p[f->numpoints]);
\r
372 VectorCopy (p1, b->p[b->numpoints]);
\r
377 if (sides[i] == SIDE_FRONT)
\r
379 VectorCopy (p1, f->p[f->numpoints]);
\r
382 if (sides[i] == SIDE_BACK)
\r
384 VectorCopy (p1, b->p[b->numpoints]);
\r
388 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
\r
391 // generate a split point
\r
392 p2 = in->p[(i+1)%in->numpoints];
\r
394 dot = dists[i] / (dists[i]-dists[i+1]);
\r
395 for (j=0 ; j<3 ; j++)
\r
396 { // avoid round off error when possible
\r
397 if (normal[j] == 1)
\r
399 else if (normal[j] == -1)
\r
402 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
\r
405 VectorCopy (mid, f->p[f->numpoints]);
\r
407 VectorCopy (mid, b->p[b->numpoints]);
\r
411 if (f->numpoints > maxpts || b->numpoints > maxpts)
\r
412 Error ("ClipWinding: points exceeded estimate");
\r
413 if (f->numpoints > MAX_POINTS_ON_WINDING || b->numpoints > MAX_POINTS_ON_WINDING)
\r
414 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
\r
423 void ChopWindingInPlace (winding_t **inout, vec3_t normal, vec_t dist, vec_t epsilon)
\r
426 vec_t dists[MAX_POINTS_ON_WINDING+4];
\r
427 int sides[MAX_POINTS_ON_WINDING+4];
\r
429 static vec_t dot; // VC 4.2 optimizer bug if not static
\r
437 counts[0] = counts[1] = counts[2] = 0;
\r
439 // determine sides for each point
\r
440 for (i=0 ; i<in->numpoints ; i++)
\r
442 dot = DotProduct (in->p[i], normal);
\r
446 sides[i] = SIDE_FRONT;
\r
447 else if (dot < -epsilon)
\r
448 sides[i] = SIDE_BACK;
\r
451 sides[i] = SIDE_ON;
\r
453 counts[sides[i]]++;
\r
455 sides[i] = sides[0];
\r
456 dists[i] = dists[0];
\r
465 return; // inout stays the same
\r
467 maxpts = in->numpoints+4; // cant use counts[0]+2 because
\r
468 // of fp grouping errors
\r
470 f = AllocWinding (maxpts);
\r
472 for (i=0 ; i<in->numpoints ; i++)
\r
476 if (sides[i] == SIDE_ON)
\r
478 VectorCopy (p1, f->p[f->numpoints]);
\r
483 if (sides[i] == SIDE_FRONT)
\r
485 VectorCopy (p1, f->p[f->numpoints]);
\r
489 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
\r
492 // generate a split point
\r
493 p2 = in->p[(i+1)%in->numpoints];
\r
495 dot = dists[i] / (dists[i]-dists[i+1]);
\r
496 for (j=0 ; j<3 ; j++)
\r
497 { // avoid round off error when possible
\r
498 if (normal[j] == 1)
\r
500 else if (normal[j] == -1)
\r
503 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
\r
506 VectorCopy (mid, f->p[f->numpoints]);
\r
510 if (f->numpoints > maxpts)
\r
511 Error ("ClipWinding: points exceeded estimate");
\r
512 if (f->numpoints > MAX_POINTS_ON_WINDING)
\r
513 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
\r
524 Returns the fragment of in that is on the front side
\r
525 of the cliping plane. The original is freed.
\r
528 winding_t *ChopWinding (winding_t *in, vec3_t normal, vec_t dist)
\r
532 ClipWindingEpsilon (in, normal, dist, ON_EPSILON, &f, &b);
\r
546 void CheckWinding (winding_t *w)
\r
551 vec3_t dir, edgenormal, facenormal;
\r
555 if (w->numpoints < 3)
\r
556 Error ("CheckWinding: %i points",w->numpoints);
\r
558 area = WindingArea(w);
\r
560 Error ("CheckWinding: %f area", area);
\r
562 WindingPlane (w, facenormal, &facedist);
\r
564 for (i=0 ; i<w->numpoints ; i++)
\r
568 for (j=0 ; j<3 ; j++)
\r
569 if (p1[j] > BOGUS_RANGE || p1[j] < -BOGUS_RANGE)
\r
570 Error ("CheckFace: BUGUS_RANGE: %f",p1[j]);
\r
572 j = i+1 == w->numpoints ? 0 : i+1;
\r
574 // check the point is on the face plane
\r
575 d = DotProduct (p1, facenormal) - facedist;
\r
576 if (d < -ON_EPSILON || d > ON_EPSILON)
\r
577 Error ("CheckWinding: point off plane");
\r
579 // check the edge isnt degenerate
\r
581 VectorSubtract (p2, p1, dir);
\r
583 if (VectorLength (dir) < ON_EPSILON)
\r
584 Error ("CheckWinding: degenerate edge");
\r
586 CrossProduct (facenormal, dir, edgenormal);
\r
587 VectorNormalize (edgenormal, edgenormal);
\r
588 edgedist = DotProduct (p1, edgenormal);
\r
589 edgedist += ON_EPSILON;
\r
591 // all other points must be on front side
\r
592 for (j=0 ; j<w->numpoints ; j++)
\r
596 d = DotProduct (w->p[j], edgenormal);
\r
598 Error ("CheckWinding: non-convex");
\r
609 int WindingOnPlaneSide (winding_t *w, vec3_t normal, vec_t dist)
\r
611 qboolean front, back;
\r
617 for (i=0 ; i<w->numpoints ; i++)
\r
619 d = DotProduct (w->p[i], normal) - dist;
\r
620 if (d < -ON_EPSILON)
\r
627 if (d > ON_EPSILON)
\r