1 /* -------------------------------------------------------------------------------
3 Copyright (C) 1999-2007 id Software, Inc. and contributors.
4 For a list of contributors, see the accompanying CONTRIBUTORS file.
6 This file is part of GtkRadiant.
8 GtkRadiant is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 GtkRadiant is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GtkRadiant; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 ----------------------------------------------------------------------------------
24 This code has been altered significantly from its original form, to support
25 several games based on the Quake III Arena engine, in the form of "Q3Map2."
27 ------------------------------------------------------------------------------- */
42 typedef struct edgePoint_s {
45 struct edgePoint_s *prev, *next;
48 typedef struct edgeLine_s {
58 edgePoint_t *chain; // unused element of doubly linked list
66 originalEdge_t *originalEdges = NULL;
68 int allocatedOriginalEdges = 0;
71 edgeLine_t *edgeLines = NULL;
73 int allocatedEdgeLines = 0;
75 int c_degenerateEdges;
79 int c_natural, c_rotate, c_cant;
81 // these should be whatever epsilon we actually expect,
82 // plus SNAP_INT_TO_FLOAT
83 #define LINE_POSITION_EPSILON 0.25
84 #define POINT_ON_LINE_EPSILON 0.25
91 void InsertPointOnEdge( vec3_t v, edgeLine_t *e ) {
94 edgePoint_t *p, *scan;
96 VectorSubtract( v, e->origin, delta );
97 d = DotProduct( delta, e->dir );
99 p = safe_malloc( sizeof(edgePoint_t) );
101 VectorCopy( v, p->xyz );
103 if ( e->chain->next == e->chain ) {
104 e->chain->next = e->chain->prev = p;
105 p->next = p->prev = e->chain;
109 scan = e->chain->next;
110 for ( ; scan != e->chain ; scan = scan->next ) {
111 d = p->intercept - scan->intercept;
112 if ( d > -LINE_POSITION_EPSILON && d < LINE_POSITION_EPSILON ) {
114 return; // the point is already set
117 if ( p->intercept < scan->intercept ) {
119 p->prev = scan->prev;
121 scan->prev->next = p;
128 p->prev = scan->prev;
130 scan->prev->next = p;
140 int AddEdge( vec3_t v1, vec3_t v2, qboolean createNonAxial ) {
146 VectorSubtract( v2, v1, dir );
147 d = VectorNormalize( dir, dir );
149 // if we added a 0 length vector, it would make degenerate planes
154 if ( !createNonAxial ) {
155 if ( fabs( dir[0] + dir[1] + dir[2] ) != 1.0 ) {
156 AUTOEXPAND_BY_REALLOC(originalEdges, numOriginalEdges, allocatedOriginalEdges, 1024);
157 originalEdges[ numOriginalEdges ].dv[0] = (bspDrawVert_t *)v1;
158 originalEdges[ numOriginalEdges ].dv[1] = (bspDrawVert_t *)v2;
159 originalEdges[ numOriginalEdges ].length = d;
165 for ( i = 0 ; i < numEdgeLines ; i++ ) {
168 d = DotProduct( v1, e->normal1 ) - e->dist1;
169 if ( d < -POINT_ON_LINE_EPSILON || d > POINT_ON_LINE_EPSILON ) {
172 d = DotProduct( v1, e->normal2 ) - e->dist2;
173 if ( d < -POINT_ON_LINE_EPSILON || d > POINT_ON_LINE_EPSILON ) {
177 d = DotProduct( v2, e->normal1 ) - e->dist1;
178 if ( d < -POINT_ON_LINE_EPSILON || d > POINT_ON_LINE_EPSILON ) {
181 d = DotProduct( v2, e->normal2 ) - e->dist2;
182 if ( d < -POINT_ON_LINE_EPSILON || d > POINT_ON_LINE_EPSILON ) {
187 InsertPointOnEdge( v1, e );
188 InsertPointOnEdge( v2, e );
193 AUTOEXPAND_BY_REALLOC(edgeLines, numEdgeLines, allocatedEdgeLines, 1024);
195 e = &edgeLines[ numEdgeLines ];
198 e->chain = safe_malloc( sizeof(edgePoint_t) );
199 e->chain->next = e->chain->prev = e->chain;
201 VectorCopy( v1, e->origin );
202 VectorCopy( dir, e->dir );
204 MakeNormalVectors( e->dir, e->normal1, e->normal2 );
205 e->dist1 = DotProduct( e->origin, e->normal1 );
206 e->dist2 = DotProduct( e->origin, e->normal2 );
208 InsertPointOnEdge( v1, e );
209 InsertPointOnEdge( v2, e );
211 return numEdgeLines - 1;
218 adds a surface's edges
221 void AddSurfaceEdges( mapDrawSurface_t *ds )
226 for( i = 0; i < ds->numVerts; i++ )
228 /* save the edge number in the lightmap field so we don't need to look it up again */
229 ds->verts[i].lightmap[ 0 ][ 0 ] =
230 AddEdge( ds->verts[ i ].xyz, ds->verts[ (i + 1) % ds->numVerts ].xyz, qfalse );
238 determines if an edge is colinear
241 qboolean ColinearEdge( vec3_t v1, vec3_t v2, vec3_t v3 )
243 vec3_t midpoint, dir, offset, on;
246 VectorSubtract( v2, v1, midpoint );
247 VectorSubtract( v3, v1, dir );
248 d = VectorNormalize( dir, dir );
250 return qfalse; // degenerate
253 d = DotProduct( midpoint, dir );
254 VectorScale( dir, d, on );
255 VectorSubtract( midpoint, on, offset );
256 d = VectorLength ( offset );
271 Add colinear border edges, which will fix some classes of patch to
275 void AddPatchEdges( mapDrawSurface_t *ds ) {
279 for ( i = 0 ; i < ds->patchWidth - 2; i+=2 ) {
280 v1 = ds->verts[ i ].xyz;
281 v2 = ds->verts[ i + 1 ].xyz;
282 v3 = ds->verts[ i + 2 ].xyz;
284 // if v2 is the midpoint of v1 to v3, add an edge from v1 to v3
285 if ( ColinearEdge( v1, v2, v3 ) ) {
286 AddEdge( v1, v3, qfalse );
289 v1 = ds->verts[ ( ds->patchHeight - 1 ) * ds->patchWidth + i ].xyz;
290 v2 = ds->verts[ ( ds->patchHeight - 1 ) * ds->patchWidth + i + 1 ].xyz;
291 v3 = ds->verts[ ( ds->patchHeight - 1 ) * ds->patchWidth + i + 2 ].xyz;
293 // if v2 is on the v1 to v3 line, add an edge from v1 to v3
294 if ( ColinearEdge( v1, v2, v3 ) ) {
295 AddEdge( v1, v3, qfalse );
299 for ( i = 0 ; i < ds->patchHeight - 2 ; i+=2 ) {
300 v1 = ds->verts[ i * ds->patchWidth ].xyz;
301 v2 = ds->verts[ ( i + 1 ) * ds->patchWidth ].xyz;
302 v3 = ds->verts[ ( i + 2 ) * ds->patchWidth ].xyz;
304 // if v2 is the midpoint of v1 to v3, add an edge from v1 to v3
305 if ( ColinearEdge( v1, v2, v3 ) ) {
306 AddEdge( v1, v3, qfalse );
309 v1 = ds->verts[ ( ds->patchWidth - 1 ) + i * ds->patchWidth ].xyz;
310 v2 = ds->verts[ ( ds->patchWidth - 1 ) + ( i + 1 ) * ds->patchWidth ].xyz;
311 v3 = ds->verts[ ( ds->patchWidth - 1 ) + ( i + 2 ) * ds->patchWidth ].xyz;
313 // if v2 is the midpoint of v1 to v3, add an edge from v1 to v3
314 if ( ColinearEdge( v1, v2, v3 ) ) {
315 AddEdge( v1, v3, qfalse );
328 #define MAX_SURFACE_VERTS 256
329 void FixSurfaceJunctions( mapDrawSurface_t *ds ) {
333 int counts[MAX_SURFACE_VERTS];
334 int originals[MAX_SURFACE_VERTS];
335 bspDrawVert_t verts[MAX_SURFACE_VERTS], *v1, *v2;
337 float start, end, frac, c;
342 for ( i = 0 ; i < ds->numVerts ; i++ )
347 if ( numVerts == MAX_SURFACE_VERTS ) {
348 Error( "MAX_SURFACE_VERTS" );
350 verts[numVerts] = ds->verts[i];
351 originals[numVerts] = i;
354 // check to see if there are any t junctions before the next vert
356 v2 = &ds->verts[ (i+1) % ds->numVerts ];
358 j = (int)ds->verts[i].lightmap[ 0 ][ 0 ];
360 continue; // degenerate edge
364 VectorSubtract( v1->xyz, e->origin, delta );
365 start = DotProduct( delta, e->dir );
367 VectorSubtract( v2->xyz, e->origin, delta );
368 end = DotProduct( delta, e->dir );
377 for ( ; p != e->chain ; ) {
379 if ( p->intercept > end - ON_EPSILON ) {
383 if ( p->intercept < end + ON_EPSILON ) {
389 ( start < end && p->intercept > start + ON_EPSILON ) ||
390 ( start > end && p->intercept < start - ON_EPSILON ) ) {
392 if ( numVerts == MAX_SURFACE_VERTS ) {
393 Error( "MAX_SURFACE_VERTS" );
396 /* take the exact intercept point */
397 VectorCopy( p->xyz, verts[ numVerts ].xyz );
399 /* interpolate the texture coordinates */
400 frac = ( p->intercept - start ) / ( end - start );
401 for ( j = 0 ; j < 2 ; j++ ) {
402 verts[ numVerts ].st[j] = v1->st[j] +
403 frac * ( v2->st[j] - v1->st[j] );
406 /* copy the normal (FIXME: what about nonplanar surfaces? */
407 VectorCopy( v1->normal, verts[ numVerts ].normal );
409 /* ydnar: interpolate the color */
410 for( k = 0; k < MAX_LIGHTMAPS; k++ )
412 for( j = 0; j < 4; j++ )
414 c = (float) v1->color[ k ][ j ] + frac * ((float) v2->color[ k ][ j ] - (float) v1->color[ k ][ j ]);
415 verts[ numVerts ].color[ k ][ j ] = (byte) (c < 255.0f ? c : 255);
420 originals[ numVerts ] = i;
433 c_addedVerts += numVerts - ds->numVerts;
434 c_totalVerts += numVerts;
437 // FIXME: check to see if the entire surface degenerated
440 // rotate the points so that the initial vertex is between
441 // two non-subdivided edges
442 for ( i = 0 ; i < numVerts ; i++ ) {
443 if ( originals[ (i+1) % numVerts ] == originals[ i ] ) {
446 j = (i + numVerts - 1 ) % numVerts;
447 k = (i + numVerts - 2 ) % numVerts;
448 if ( originals[ j ] == originals[ k ] ) {
455 // fine the way it is
458 ds->numVerts = numVerts;
459 ds->verts = safe_malloc( numVerts * sizeof( *ds->verts ) );
460 memcpy( ds->verts, verts, numVerts * sizeof( *ds->verts ) );
464 if ( i == numVerts ) {
465 // create a vertex in the middle to start the fan
469 memset ( &verts[numVerts], 0, sizeof( verts[numVerts] ) );
470 for ( i = 0 ; i < numVerts ; i++ ) {
471 for ( j = 0 ; j < 10 ; j++ ) {
472 verts[numVerts].xyz[j] += verts[i].xyz[j];
475 for ( j = 0 ; j < 10 ; j++ ) {
476 verts[numVerts].xyz[j] /= numVerts;
483 // just rotate the vertexes
488 ds->numVerts = numVerts;
489 ds->verts = safe_malloc( numVerts * sizeof( *ds->verts ) );
491 for ( j = 0 ; j < ds->numVerts ; j++ ) {
492 ds->verts[j] = verts[ ( j + i ) % ds->numVerts ];
501 FixBrokenSurface() - ydnar
502 removes nearly coincident verts from a planar winding surface
503 returns qfalse if the surface is broken
506 extern void SnapWeldVector( vec3_t a, vec3_t b, vec3_t out );
508 #define DEGENERATE_EPSILON 0.1
512 qboolean FixBrokenSurface( mapDrawSurface_t *ds )
514 bspDrawVert_t *dv1, *dv2, avg;
522 if( ds->type != SURFACE_FACE )
525 /* check all verts */
526 for( i = 0; i < ds->numVerts; i++ )
529 dv1 = &ds->verts[ i ];
530 dv2 = &ds->verts[ (i + 1) % ds->numVerts ];
532 /* degenerate edge? */
533 VectorSubtract( dv1->xyz, dv2->xyz, avg.xyz );
534 dist = VectorLength( avg.xyz );
535 if( dist < DEGENERATE_EPSILON )
537 Sys_FPrintf( SYS_VRB, "WARNING: Degenerate T-junction edge found, fixing...\n" );
539 /* create an average drawvert */
540 /* ydnar 2002-01-26: added nearest-integer welding preference */
541 SnapWeldVector( dv1->xyz, dv2->xyz, avg.xyz );
542 VectorAdd( dv1->normal, dv2->normal, avg.normal );
543 VectorNormalize( avg.normal, avg.normal );
544 avg.st[ 0 ] = (dv1->st[ 0 ] + dv2->st[ 0 ]) * 0.5f;
545 avg.st[ 1 ] = (dv1->st[ 1 ] + dv2->st[ 1 ]) * 0.5f;
547 /* lightmap st/colors */
548 for( k = 0; k < MAX_LIGHTMAPS; k++ )
550 avg.lightmap[ k ][ 0 ] = (dv1->lightmap[ k ][ 0 ] + dv2->lightmap[ k ][ 0 ]) * 0.5f;
551 avg.lightmap[ k ][ 1 ] = (dv1->lightmap[ k ][ 1 ] + dv2->lightmap[ k ][ 1 ]) * 0.5f;
552 for( j = 0; j < 4; j++ )
553 avg.color[ k ][ j ] = (int) (dv1->color[ k ][ j ] + dv2->color[ k ][ j ]) >> 1;
557 memcpy( dv1, &avg, sizeof( avg ) );
559 /* move the remaining verts */
560 for( k = i + 2; k < ds->numVerts; k++ )
563 dv1 = &ds->verts[ k ];
564 dv2 = &ds->verts[ k - 1 ];
567 memcpy( dv2, dv1, sizeof( bspDrawVert_t ) );
571 /* after welding, we have to consider the same vertex again, as it now has a new neighbor dv2 */
574 /* should ds->numVerts have become 0, then i is now -1. In the next iteration, the loop will abort. */
578 /* one last check and return */
579 return ds->numVerts >= 3;
595 int EdgeCompare( const void *elem1, const void *elem2 ) {
598 d1 = ((const originalEdge_t *)elem1)->length;
599 d2 = ((const originalEdge_t *)elem2)->length;
614 call after the surface list has been pruned
617 void FixTJunctions( entity_t *ent )
620 mapDrawSurface_t *ds;
626 /* meta mode has its own t-junction code (currently not as good as this code) */
631 Sys_FPrintf( SYS_VRB, "--- FixTJunctions ---\n" );
633 numOriginalEdges = 0;
636 // this actually creates axial edges, but it
637 // only creates originalEdge_t structures
638 // for non-axial edges
639 for ( i = ent->firstDrawSurf ; i < numMapDrawSurfs ; i++ )
641 /* get surface and early out if possible */
642 ds = &mapDrawSurfs[ i ];
644 if( (si->compileFlags & C_NODRAW) || si->autosprite || si->notjunc || ds->numVerts == 0 )
647 /* ydnar: gs mods: handle the various types of surfaces */
650 /* handle brush faces */
652 AddSurfaceEdges( ds );
660 /* fixme: make triangle surfaces t-junction */
666 axialEdgeLines = numEdgeLines;
668 // sort the non-axial edges by length
669 qsort( originalEdges, numOriginalEdges, sizeof(originalEdges[0]), EdgeCompare );
671 // add the non-axial edges, longest first
672 // this gives the most accurate edge description
673 for ( i = 0 ; i < numOriginalEdges ; i++ ) {
674 e = &originalEdges[i];
675 dv = e->dv[0]; // e might change during AddEdge
676 dv->lightmap[ 0 ][ 0 ] = AddEdge( e->dv[ 0 ]->xyz, e->dv[ 1 ]->xyz, qtrue );
679 Sys_FPrintf( SYS_VRB, "%9d axial edge lines\n", axialEdgeLines );
680 Sys_FPrintf( SYS_VRB, "%9d non-axial edge lines\n", numEdgeLines - axialEdgeLines );
681 Sys_FPrintf( SYS_VRB, "%9d degenerate edges\n", c_degenerateEdges );
683 // insert any needed vertexes
684 for( i = ent->firstDrawSurf; i < numMapDrawSurfs ; i++ )
686 /* get surface and early out if possible */
687 ds = &mapDrawSurfs[ i ];
689 if( (si->compileFlags & C_NODRAW) || si->autosprite || si->notjunc || ds->numVerts == 0 || ds->type != SURFACE_FACE )
692 /* ydnar: gs mods: handle the various types of surfaces */
695 /* handle brush faces */
697 FixSurfaceJunctions( ds );
698 if( FixBrokenSurface( ds ) == qfalse )
705 /* fixme: t-junction triangle models and patches */
711 /* emit some statistics */
712 Sys_FPrintf( SYS_VRB, "%9d verts added for T-junctions\n", c_addedVerts );
713 Sys_FPrintf( SYS_VRB, "%9d total verts\n", c_totalVerts );
714 Sys_FPrintf( SYS_VRB, "%9d naturally ordered\n", c_natural );
715 Sys_FPrintf( SYS_VRB, "%9d rotated orders\n", c_rotate );
716 Sys_FPrintf( SYS_VRB, "%9d can't order\n", c_cant );
717 Sys_FPrintf( SYS_VRB, "%9d broken (degenerate) surfaces removed\n", c_broken );