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
30 extern int numthreads;
32 // counters are only bumped when running single threaded,
33 // because they are an awefull coherence problem
34 int c_active_windings;
39 #define BOGUS_RANGE WORLD_SIZE
44 for (i=0 ; i<w->numpoints ; i++)
45 Sys_Printf ("(%5.1f, %5.1f, %5.1f)\n",w->p[i][0], w->p[i][1],w->p[i][2]);
54 winding_t *AllocWinding (int points)
59 if (points >= MAX_POINTS_ON_WINDING)
60 Error ("AllocWinding failed: MAX_POINTS_ON_WINDING exceeded");
65 c_winding_points += points;
67 if (c_active_windings > c_peak_windings)
68 c_peak_windings = c_active_windings;
70 s = sizeof(vec_t)*3*points + sizeof(int);
76 void FreeWinding (winding_t *w)
78 if (*(unsigned *)w == 0xdeaddead)
79 Error ("FreeWinding: freed a freed winding");
80 *(unsigned *)w = 0xdeaddead;
94 void RemoveColinearPoints (winding_t *w)
99 vec3_t p[MAX_POINTS_ON_WINDING];
102 for (i=0 ; i<w->numpoints ; i++)
104 j = (i+1)%w->numpoints;
105 k = (i+w->numpoints-1)%w->numpoints;
106 VectorSubtract (w->p[j], w->p[i], v1);
107 VectorSubtract (w->p[i], w->p[k], v2);
108 VectorNormalize(v1,v1);
109 VectorNormalize(v2,v2);
110 if (DotProduct(v1, v2) < 0.999)
112 VectorCopy (w->p[i], p[nump]);
117 if (nump == w->numpoints)
121 c_removed += w->numpoints - nump;
123 memcpy (w->p, p, nump*sizeof(p[0]));
131 void WindingPlane (winding_t *w, vec3_t normal, vec_t *dist)
135 VectorSubtract (w->p[1], w->p[0], v1);
136 VectorSubtract (w->p[2], w->p[0], v2);
137 CrossProduct (v2, v1, normal);
138 VectorNormalize (normal, normal);
139 *dist = DotProduct (w->p[0], normal);
148 vec_t WindingArea (winding_t *w)
151 vec3_t d1, d2, cross;
155 for (i=2 ; i<w->numpoints ; i++)
157 VectorSubtract (w->p[i-1], w->p[0], d1);
158 VectorSubtract (w->p[i], w->p[0], d2);
159 CrossProduct (d1, d2, cross);
160 total += 0.5 * VectorLength ( cross );
165 void WindingBounds (winding_t *w, vec3_t mins, vec3_t maxs)
170 mins[0] = mins[1] = mins[2] = 99999;
171 maxs[0] = maxs[1] = maxs[2] = -99999;
173 for (i=0 ; i<w->numpoints ; i++)
175 for (j=0 ; j<3 ; j++)
191 void WindingCenter (winding_t *w, vec3_t center)
196 VectorCopy (vec3_origin, center);
197 for (i=0 ; i<w->numpoints ; i++)
198 VectorAdd (w->p[i], center, center);
200 scale = 1.0/w->numpoints;
201 VectorScale (center, scale, center);
209 winding_t *BaseWindingForPlane (vec3_t normal, vec_t dist)
211 // The goal in this function is to replicate the exact behavior that was in the original
212 // BaseWindingForPlane() function (see below). The only thing we're going to change is the
213 // accuracy of the operation. The original code gave a preference for the vup vector to start
214 // out as (0, 0, 1), unless the normal had a dominant Z value, in which case vup started out
215 // as (1, 0, 0). After that, vup was "bent" [along the plane defined by normal and vup] to
216 // become perpendicular to normal. After that the vright vector was computed as the cross
217 // product of vup and normal.
219 // Once these vectors are calculated, I'm constructing the winding points in exactly the same
220 // way as was done in the original function. Orientation is the same.
222 // Note that the 4 points in the returned winding_t may actually not be necessary (3 might
223 // be enough). However, I want to minimize the chance of ANY bugs popping up due to any
224 // change in behavior of this function. Therefore, behavior stays exactly the same, except
225 // for precision of math. Performance might be better in the new function as well.
229 vec3_t vright, vup, org;
234 for (i = 0; i < 3; i++) {
241 if (x == -1) Error("BaseWindingForPlane: no axis found");
244 case 0: // Fall through to next case.
246 vright[0] = -normal[1];
247 vright[1] = normal[0];
252 vright[1] = -normal[2];
253 vright[2] = normal[1];
256 CrossProduct(normal, vright, vup);
258 // IMPORTANT NOTE: vright and vup are NOT unit vectors at this point.
259 // However, normal, vup, and vright are pairwise perpendicular.
261 VectorSetLength(vup, MAX_WORLD_COORD * 2, vup);
262 VectorSetLength(vright, MAX_WORLD_COORD * 2, vright);
263 VectorScale(normal, dist, org);
267 VectorSubtract(org, vright, w->p[0]);
268 VectorAdd(w->p[0], vup, w->p[0]);
270 VectorAdd(org, vright, w->p[1]);
271 VectorAdd(w->p[1], vup, w->p[1]);
273 VectorAdd(org, vright, w->p[2]);
274 VectorSubtract(w->p[2], vup, w->p[2]);
276 VectorSubtract(org, vright, w->p[3]);
277 VectorSubtract(w->p[3], vup, w->p[3]);
284 // Old function, not used but here for reference. Please do not modify it.
285 // (You may remove it at some point.)
286 winding_t *_BaseWindingForPlane_orig_(vec3_t normal, vec_t dist)
290 vec3_t org, vright, vup;
293 // find the major axis
307 Error ("BaseWindingForPlane: no axis found");
309 VectorCopy (vec3_origin, vup);
321 v = DotProduct (vup, normal);
322 VectorMA (vup, -v, normal, vup);
323 VectorNormalize (vup, vup);
325 VectorScale (normal, dist, org);
327 CrossProduct (vup, normal, vright);
329 // LordHavoc: this has to use *2 because otherwise some created points may
330 // be inside the world (think of a diagonal case), and any brush with such
331 // points should be removed, failure to detect such cases is disasterous
332 VectorScale (vup, MAX_WORLD_COORD*2, vup);
333 VectorScale (vright, MAX_WORLD_COORD*2, vright);
335 // project a really big axis aligned box onto the plane
336 w = AllocWinding (4);
338 VectorSubtract (org, vright, w->p[0]);
339 VectorAdd (w->p[0], vup, w->p[0]);
341 VectorAdd (org, vright, w->p[1]);
342 VectorAdd (w->p[1], vup, w->p[1]);
344 VectorAdd (org, vright, w->p[2]);
345 VectorSubtract (w->p[2], vup, w->p[2]);
347 VectorSubtract (org, vright, w->p[3]);
348 VectorSubtract (w->p[3], vup, w->p[3]);
360 winding_t *CopyWinding (winding_t *w)
365 c = AllocWinding (w->numpoints);
366 size = (int)((size_t)((winding_t *)0)->p[w->numpoints]);
376 winding_t *ReverseWinding (winding_t *w)
381 c = AllocWinding (w->numpoints);
382 for (i=0 ; i<w->numpoints ; i++)
384 VectorCopy (w->p[w->numpoints-1-i], c->p[i]);
386 c->numpoints = w->numpoints;
396 void ClipWindingEpsilon (winding_t *in, vec3_t normal, vec_t dist,
397 vec_t epsilon, winding_t **front, winding_t **back)
399 vec_t dists[MAX_POINTS_ON_WINDING+4];
400 int sides[MAX_POINTS_ON_WINDING+4];
402 static vec_t dot; // VC 4.2 optimizer bug if not static
409 counts[0] = counts[1] = counts[2] = 0;
411 // determine sides for each point
412 for (i=0 ; i<in->numpoints ; i++)
415 dot = DotProduct (in->p[i], normal);
419 sides[i] = SIDE_FRONT;
420 else if (dot < -epsilon)
421 sides[i] = SIDE_BACK;
431 *front = *back = NULL;
435 *back = CopyWinding (in);
440 *front = CopyWinding (in);
444 maxpts = in->numpoints+4; // cant use counts[0]+2 because
445 // of fp grouping errors
447 *front = f = AllocWinding (maxpts);
448 *back = b = AllocWinding (maxpts);
450 for (i=0 ; i<in->numpoints ; i++)
454 if (sides[i] == SIDE_ON)
456 VectorCopy (p1, f->p[f->numpoints]);
458 VectorCopy (p1, b->p[b->numpoints]);
463 if (sides[i] == SIDE_FRONT)
465 VectorCopy (p1, f->p[f->numpoints]);
468 if (sides[i] == SIDE_BACK)
470 VectorCopy (p1, b->p[b->numpoints]);
474 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
477 // generate a split point
478 p2 = in->p[(i+1)%in->numpoints];
480 dot = dists[i] / (dists[i]-dists[i+1]);
481 for (j=0 ; j<3 ; j++)
482 { // avoid round off error when possible
485 else if (normal[j] == -1)
488 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
491 VectorCopy (mid, f->p[f->numpoints]);
493 VectorCopy (mid, b->p[b->numpoints]);
497 if (f->numpoints > maxpts || b->numpoints > maxpts)
498 Error ("ClipWinding: points exceeded estimate");
499 if (f->numpoints > MAX_POINTS_ON_WINDING || b->numpoints > MAX_POINTS_ON_WINDING)
500 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
509 void ChopWindingInPlace (winding_t **inout, vec3_t normal, vec_t dist, vec_t epsilon)
512 vec_t dists[MAX_POINTS_ON_WINDING+4];
513 int sides[MAX_POINTS_ON_WINDING+4];
515 static vec_t dot; // VC 4.2 optimizer bug if not static
523 counts[0] = counts[1] = counts[2] = 0;
525 // determine sides for each point
526 for (i=0 ; i<in->numpoints ; i++)
528 dot = DotProduct (in->p[i], normal);
532 sides[i] = SIDE_FRONT;
533 else if (dot < -epsilon)
534 sides[i] = SIDE_BACK;
551 return; // inout stays the same
553 maxpts = in->numpoints+4; // cant use counts[0]+2 because
554 // of fp grouping errors
556 f = AllocWinding (maxpts);
558 for (i=0 ; i<in->numpoints ; i++)
562 if (sides[i] == SIDE_ON)
564 VectorCopy (p1, f->p[f->numpoints]);
569 if (sides[i] == SIDE_FRONT)
571 VectorCopy (p1, f->p[f->numpoints]);
575 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
578 // generate a split point
579 p2 = in->p[(i+1)%in->numpoints];
581 dot = dists[i] / (dists[i]-dists[i+1]);
582 for (j=0 ; j<3 ; j++)
583 { // avoid round off error when possible
586 else if (normal[j] == -1)
589 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
592 VectorCopy (mid, f->p[f->numpoints]);
596 if (f->numpoints > maxpts)
597 Error ("ClipWinding: points exceeded estimate");
598 if (f->numpoints > MAX_POINTS_ON_WINDING)
599 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
610 Returns the fragment of in that is on the front side
611 of the cliping plane. The original is freed.
614 winding_t *ChopWinding (winding_t *in, vec3_t normal, vec_t dist)
618 ClipWindingEpsilon (in, normal, dist, ON_EPSILON, &f, &b);
632 void CheckWinding (winding_t *w)
637 vec3_t dir, edgenormal, facenormal;
641 if (w->numpoints < 3)
642 Error ("CheckWinding: %i points",w->numpoints);
644 area = WindingArea(w);
646 Error ("CheckWinding: %f area", area);
648 WindingPlane (w, facenormal, &facedist);
650 for (i=0 ; i<w->numpoints ; i++)
654 for (j=0 ; j<3 ; j++)
655 if (p1[j] > MAX_WORLD_COORD || p1[j] < MIN_WORLD_COORD)
656 Error ("CheckFace: MAX_WORLD_COORD exceeded: %f",p1[j]);
658 j = i+1 == w->numpoints ? 0 : i+1;
660 // check the point is on the face plane
661 d = DotProduct (p1, facenormal) - facedist;
662 if (d < -ON_EPSILON || d > ON_EPSILON)
663 Error ("CheckWinding: point off plane");
665 // check the edge isnt degenerate
667 VectorSubtract (p2, p1, dir);
669 if (VectorLength (dir) < ON_EPSILON)
670 Error ("CheckWinding: degenerate edge");
672 CrossProduct (facenormal, dir, edgenormal);
673 VectorNormalize (edgenormal, edgenormal);
674 edgedist = DotProduct (p1, edgenormal);
675 edgedist += ON_EPSILON;
677 // all other points must be on front side
678 for (j=0 ; j<w->numpoints ; j++)
682 d = DotProduct (w->p[j], edgenormal);
684 Error ("CheckWinding: non-convex");
695 int WindingOnPlaneSide (winding_t *w, vec3_t normal, vec_t dist)
697 qboolean front, back;
703 for (i=0 ; i<w->numpoints ; i++)
705 d = DotProduct (w->p[i], normal) - dist;
732 AddWindingToConvexHull
734 Both w and *hull are on the same plane
737 #define MAX_HULL_POINTS 128
738 void AddWindingToConvexHull( winding_t *w, winding_t **hull, vec3_t normal ) {
743 int numHullPoints, numNew;
744 vec3_t hullPoints[MAX_HULL_POINTS];
745 vec3_t newHullPoints[MAX_HULL_POINTS];
746 vec3_t hullDirs[MAX_HULL_POINTS];
747 qboolean hullSide[MAX_HULL_POINTS];
751 *hull = CopyWinding( w );
755 numHullPoints = (*hull)->numpoints;
756 memcpy( hullPoints, (*hull)->p, numHullPoints * sizeof(vec3_t) );
758 for ( i = 0 ; i < w->numpoints ; i++ ) {
761 // calculate hull side vectors
762 for ( j = 0 ; j < numHullPoints ; j++ ) {
763 k = ( j + 1 ) % numHullPoints;
765 VectorSubtract( hullPoints[k], hullPoints[j], dir );
766 VectorNormalize( dir, dir );
767 CrossProduct( normal, dir, hullDirs[j] );
771 for ( j = 0 ; j < numHullPoints ; j++ ) {
772 VectorSubtract( p, hullPoints[j], dir );
773 d = DotProduct( dir, hullDirs[j] );
774 if ( d >= ON_EPSILON ) {
777 if ( d >= -ON_EPSILON ) {
780 hullSide[j] = qfalse;
784 // if the point is effectively inside, do nothing
789 // find the back side to front side transition
790 for ( j = 0 ; j < numHullPoints ; j++ ) {
791 if ( !hullSide[ j % numHullPoints ] && hullSide[ (j + 1) % numHullPoints ] ) {
795 if ( j == numHullPoints ) {
799 // insert the point here
800 VectorCopy( p, newHullPoints[0] );
803 // copy over all points that aren't double fronts
804 j = (j+1)%numHullPoints;
805 for ( k = 0 ; k < numHullPoints ; k++ ) {
806 if ( hullSide[ (j+k) % numHullPoints ] && hullSide[ (j+k+1) % numHullPoints ] ) {
809 copy = hullPoints[ (j+k+1) % numHullPoints ];
810 VectorCopy( copy, newHullPoints[numNew] );
814 numHullPoints = numNew;
815 memcpy( hullPoints, newHullPoints, numHullPoints * sizeof(vec3_t) );
818 FreeWinding( *hull );
819 w = AllocWinding( numHullPoints );
820 w->numpoints = numHullPoints;
822 memcpy( w->p, hullPoints, numHullPoints * sizeof(vec3_t) );