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)
213 vec3_t org, vright, vup;
216 // find the major axis
230 Error ("BaseWindingForPlane: no axis found");
232 VectorCopy (vec3_origin, vup);
244 v = DotProduct (vup, normal);
245 VectorMA (vup, -v, normal, vup);
246 VectorNormalize (vup, vup);
248 VectorScale (normal, dist, org);
250 CrossProduct (vup, normal, vright);
252 // LordHavoc: this has to use *2 because otherwise some created points may
253 // be inside the world (think of a diagonal case), and any brush with such
254 // points should be removed, failure to detect such cases is disasterous
255 VectorScale (vup, MAX_WORLD_COORD*2, vup);
256 VectorScale (vright, MAX_WORLD_COORD*2, vright);
258 // project a really big axis aligned box onto the plane
259 w = AllocWinding (4);
261 VectorSubtract (org, vright, w->p[0]);
262 VectorAdd (w->p[0], vup, w->p[0]);
264 VectorAdd (org, vright, w->p[1]);
265 VectorAdd (w->p[1], vup, w->p[1]);
267 VectorAdd (org, vright, w->p[2]);
268 VectorSubtract (w->p[2], vup, w->p[2]);
270 VectorSubtract (org, vright, w->p[3]);
271 VectorSubtract (w->p[3], vup, w->p[3]);
283 winding_t *CopyWinding (winding_t *w)
288 c = AllocWinding (w->numpoints);
289 size = (int)((size_t)((winding_t *)0)->p[w->numpoints]);
299 winding_t *ReverseWinding (winding_t *w)
304 c = AllocWinding (w->numpoints);
305 for (i=0 ; i<w->numpoints ; i++)
307 VectorCopy (w->p[w->numpoints-1-i], c->p[i]);
309 c->numpoints = w->numpoints;
319 void ClipWindingEpsilon (winding_t *in, vec3_t normal, vec_t dist,
320 vec_t epsilon, winding_t **front, winding_t **back)
322 vec_t dists[MAX_POINTS_ON_WINDING+4];
323 int sides[MAX_POINTS_ON_WINDING+4];
325 static vec_t dot; // VC 4.2 optimizer bug if not static
332 counts[0] = counts[1] = counts[2] = 0;
334 // determine sides for each point
335 for (i=0 ; i<in->numpoints ; i++)
338 dot = DotProduct (in->p[i], normal);
342 sides[i] = SIDE_FRONT;
343 else if (dot < -epsilon)
344 sides[i] = SIDE_BACK;
354 *front = *back = NULL;
358 *back = CopyWinding (in);
363 *front = CopyWinding (in);
367 maxpts = in->numpoints+4; // cant use counts[0]+2 because
368 // of fp grouping errors
370 *front = f = AllocWinding (maxpts);
371 *back = b = AllocWinding (maxpts);
373 for (i=0 ; i<in->numpoints ; i++)
377 if (sides[i] == SIDE_ON)
379 VectorCopy (p1, f->p[f->numpoints]);
381 VectorCopy (p1, b->p[b->numpoints]);
386 if (sides[i] == SIDE_FRONT)
388 VectorCopy (p1, f->p[f->numpoints]);
391 if (sides[i] == SIDE_BACK)
393 VectorCopy (p1, b->p[b->numpoints]);
397 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
400 // generate a split point
401 p2 = in->p[(i+1)%in->numpoints];
403 dot = dists[i] / (dists[i]-dists[i+1]);
404 for (j=0 ; j<3 ; j++)
405 { // avoid round off error when possible
408 else if (normal[j] == -1)
411 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
414 VectorCopy (mid, f->p[f->numpoints]);
416 VectorCopy (mid, b->p[b->numpoints]);
420 if (f->numpoints > maxpts || b->numpoints > maxpts)
421 Error ("ClipWinding: points exceeded estimate");
422 if (f->numpoints > MAX_POINTS_ON_WINDING || b->numpoints > MAX_POINTS_ON_WINDING)
423 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
432 void ChopWindingInPlace (winding_t **inout, vec3_t normal, vec_t dist, vec_t epsilon)
435 vec_t dists[MAX_POINTS_ON_WINDING+4];
436 int sides[MAX_POINTS_ON_WINDING+4];
438 static vec_t dot; // VC 4.2 optimizer bug if not static
446 counts[0] = counts[1] = counts[2] = 0;
448 // determine sides for each point
449 for (i=0 ; i<in->numpoints ; i++)
451 dot = DotProduct (in->p[i], normal);
455 sides[i] = SIDE_FRONT;
456 else if (dot < -epsilon)
457 sides[i] = SIDE_BACK;
474 return; // inout stays the same
476 maxpts = in->numpoints+4; // cant use counts[0]+2 because
477 // of fp grouping errors
479 f = AllocWinding (maxpts);
481 for (i=0 ; i<in->numpoints ; i++)
485 if (sides[i] == SIDE_ON)
487 VectorCopy (p1, f->p[f->numpoints]);
492 if (sides[i] == SIDE_FRONT)
494 VectorCopy (p1, f->p[f->numpoints]);
498 if (sides[i+1] == SIDE_ON || sides[i+1] == sides[i])
501 // generate a split point
502 p2 = in->p[(i+1)%in->numpoints];
504 dot = dists[i] / (dists[i]-dists[i+1]);
505 for (j=0 ; j<3 ; j++)
506 { // avoid round off error when possible
509 else if (normal[j] == -1)
512 mid[j] = p1[j] + dot*(p2[j]-p1[j]);
515 VectorCopy (mid, f->p[f->numpoints]);
519 if (f->numpoints > maxpts)
520 Error ("ClipWinding: points exceeded estimate");
521 if (f->numpoints > MAX_POINTS_ON_WINDING)
522 Error ("ClipWinding: MAX_POINTS_ON_WINDING");
533 Returns the fragment of in that is on the front side
534 of the cliping plane. The original is freed.
537 winding_t *ChopWinding (winding_t *in, vec3_t normal, vec_t dist)
541 ClipWindingEpsilon (in, normal, dist, ON_EPSILON, &f, &b);
555 void CheckWinding (winding_t *w)
560 vec3_t dir, edgenormal, facenormal;
564 if (w->numpoints < 3)
565 Error ("CheckWinding: %i points",w->numpoints);
567 area = WindingArea(w);
569 Error ("CheckWinding: %f area", area);
571 WindingPlane (w, facenormal, &facedist);
573 for (i=0 ; i<w->numpoints ; i++)
577 for (j=0 ; j<3 ; j++)
578 if (p1[j] > MAX_WORLD_COORD || p1[j] < MIN_WORLD_COORD)
579 Error ("CheckFace: MAX_WORLD_COORD exceeded: %f",p1[j]);
581 j = i+1 == w->numpoints ? 0 : i+1;
583 // check the point is on the face plane
584 d = DotProduct (p1, facenormal) - facedist;
585 if (d < -ON_EPSILON || d > ON_EPSILON)
586 Error ("CheckWinding: point off plane");
588 // check the edge isnt degenerate
590 VectorSubtract (p2, p1, dir);
592 if (VectorLength (dir) < ON_EPSILON)
593 Error ("CheckWinding: degenerate edge");
595 CrossProduct (facenormal, dir, edgenormal);
596 VectorNormalize (edgenormal, edgenormal);
597 edgedist = DotProduct (p1, edgenormal);
598 edgedist += ON_EPSILON;
600 // all other points must be on front side
601 for (j=0 ; j<w->numpoints ; j++)
605 d = DotProduct (w->p[j], edgenormal);
607 Error ("CheckWinding: non-convex");
618 int WindingOnPlaneSide (winding_t *w, vec3_t normal, vec_t dist)
620 qboolean front, back;
626 for (i=0 ; i<w->numpoints ; i++)
628 d = DotProduct (w->p[i], normal) - dist;
655 AddWindingToConvexHull
657 Both w and *hull are on the same plane
660 #define MAX_HULL_POINTS 128
661 void AddWindingToConvexHull( winding_t *w, winding_t **hull, vec3_t normal ) {
666 int numHullPoints, numNew;
667 vec3_t hullPoints[MAX_HULL_POINTS];
668 vec3_t newHullPoints[MAX_HULL_POINTS];
669 vec3_t hullDirs[MAX_HULL_POINTS];
670 qboolean hullSide[MAX_HULL_POINTS];
674 *hull = CopyWinding( w );
678 numHullPoints = (*hull)->numpoints;
679 memcpy( hullPoints, (*hull)->p, numHullPoints * sizeof(vec3_t) );
681 for ( i = 0 ; i < w->numpoints ; i++ ) {
684 // calculate hull side vectors
685 for ( j = 0 ; j < numHullPoints ; j++ ) {
686 k = ( j + 1 ) % numHullPoints;
688 VectorSubtract( hullPoints[k], hullPoints[j], dir );
689 VectorNormalize( dir, dir );
690 CrossProduct( normal, dir, hullDirs[j] );
694 for ( j = 0 ; j < numHullPoints ; j++ ) {
695 VectorSubtract( p, hullPoints[j], dir );
696 d = DotProduct( dir, hullDirs[j] );
697 if ( d >= ON_EPSILON ) {
700 if ( d >= -ON_EPSILON ) {
703 hullSide[j] = qfalse;
707 // if the point is effectively inside, do nothing
712 // find the back side to front side transition
713 for ( j = 0 ; j < numHullPoints ; j++ ) {
714 if ( !hullSide[ j % numHullPoints ] && hullSide[ (j + 1) % numHullPoints ] ) {
718 if ( j == numHullPoints ) {
722 // insert the point here
723 VectorCopy( p, newHullPoints[0] );
726 // copy over all points that aren't double fronts
727 j = (j+1)%numHullPoints;
728 for ( k = 0 ; k < numHullPoints ; k++ ) {
729 if ( hullSide[ (j+k) % numHullPoints ] && hullSide[ (j+k+1) % numHullPoints ] ) {
732 copy = hullPoints[ (j+k+1) % numHullPoints ];
733 VectorCopy( copy, newHullPoints[numNew] );
737 numHullPoints = numNew;
738 memcpy( hullPoints, newHullPoints, numHullPoints * sizeof(vec3_t) );
741 FreeWinding( *hull );
742 w = AllocWinding( numHullPoints );
743 w->numpoints = numHullPoints;
745 memcpy( w->p, hullPoints, numHullPoints * sizeof(vec3_t) );