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 ------------------------------------------------------------------------------- */
32 #define SURFACE_META_C
41 #define LIGHTMAP_EXCEEDED -1
44 #define ST_EXCEEDED -4
45 #define UNSUITABLE_TRIANGLE -10
46 #define VERTS_EXCEEDED -1000
47 #define INDEXES_EXCEEDED -2000
49 #define GROW_META_VERTS 1024
50 #define GROW_META_TRIANGLES 1024
52 static int numMetaSurfaces, numPatchMetaSurfaces;
54 static int maxMetaVerts = 0;
55 static int numMetaVerts = 0;
56 static int firstSearchMetaVert = 0;
57 static bspDrawVert_t *metaVerts = NULL;
59 static int maxMetaTriangles = 0;
60 static int numMetaTriangles = 0;
61 static metaTriangle_t *metaTriangles = NULL;
67 called before staring a new entity to clear out the triangle list
70 void ClearMetaTriangles( void )
80 finds a matching metavertex in the global list, returning its index
83 static int FindMetaVertex( bspDrawVert_t *src )
86 bspDrawVert_t *v, *temp;
89 /* try to find an existing drawvert */
90 for( i = firstSearchMetaVert, v = &metaVerts[ i ]; i < numMetaVerts; i++, v++ )
92 if( memcmp( src, v, sizeof( bspDrawVert_t ) ) == 0 )
97 if( numMetaVerts >= maxMetaVerts )
99 /* reallocate more room */
100 maxMetaVerts += GROW_META_VERTS;
101 temp = safe_malloc( maxMetaVerts * sizeof( bspDrawVert_t ) );
102 if( metaVerts != NULL )
104 memcpy( temp, metaVerts, numMetaVerts * sizeof( bspDrawVert_t ) );
110 /* add the triangle */
111 memcpy( &metaVerts[ numMetaVerts ], src, sizeof( bspDrawVert_t ) );
114 /* return the count */
115 return (numMetaVerts - 1);
122 adds a new meta triangle, allocating more memory if necessary
125 static int AddMetaTriangle( void )
127 metaTriangle_t *temp;
131 if( numMetaTriangles >= maxMetaTriangles )
133 /* reallocate more room */
134 maxMetaTriangles += GROW_META_TRIANGLES;
135 temp = safe_malloc( maxMetaTriangles * sizeof( metaTriangle_t ) );
136 if( metaTriangles != NULL )
138 memcpy( temp, metaTriangles, numMetaTriangles * sizeof( metaTriangle_t ) );
139 free( metaTriangles );
141 metaTriangles = temp;
144 /* increment and return */
146 return numMetaTriangles - 1;
153 finds a matching metatriangle in the global list,
154 otherwise adds it and returns the index to the metatriangle
157 int FindMetaTriangle( metaTriangle_t *src, bspDrawVert_t *a, bspDrawVert_t *b, bspDrawVert_t *c, int planeNum )
164 /* detect degenerate triangles fixme: do something proper here */
165 VectorSubtract( a->xyz, b->xyz, dir );
166 if( VectorLength( dir ) < 0.125f )
168 VectorSubtract( b->xyz, c->xyz, dir );
169 if( VectorLength( dir ) < 0.125f )
171 VectorSubtract( c->xyz, a->xyz, dir );
172 if( VectorLength( dir ) < 0.125f )
178 /* because of precision issues with small triangles, try to use the specified plane */
179 src->planeNum = planeNum;
180 VectorCopy( mapplanes[ planeNum ].normal, src->plane );
181 src->plane[ 3 ] = mapplanes[ planeNum ].dist;
185 /* calculate a plane from the triangle's points (and bail if a plane can't be constructed) */
187 if( PlaneFromPoints( src->plane, a->xyz, b->xyz, c->xyz ) == qfalse )
191 /* ydnar 2002-10-03: repair any bogus normals (busted ase import kludge) */
192 if( VectorLength( a->normal ) <= 0.0f )
193 VectorCopy( src->plane, a->normal );
194 if( VectorLength( b->normal ) <= 0.0f )
195 VectorCopy( src->plane, b->normal );
196 if( VectorLength( c->normal ) <= 0.0f )
197 VectorCopy( src->plane, c->normal );
199 /* ydnar 2002-10-04: set lightmap axis if not already set */
200 if( !(src->si->compileFlags & C_VERTEXLIT) &&
201 src->lightmapAxis[ 0 ] == 0.0f && src->lightmapAxis[ 1 ] == 0.0f && src->lightmapAxis[ 2 ] == 0.0f )
203 /* the shader can specify an explicit lightmap axis */
204 if( src->si->lightmapAxis[ 0 ] || src->si->lightmapAxis[ 1 ] || src->si->lightmapAxis[ 2 ] )
205 VectorCopy( src->si->lightmapAxis, src->lightmapAxis );
207 /* new axis-finding code */
209 CalcLightmapAxis( src->plane, src->lightmapAxis );
212 /* fill out the src triangle */
213 src->indexes[ 0 ] = FindMetaVertex( a );
214 src->indexes[ 1 ] = FindMetaVertex( b );
215 src->indexes[ 2 ] = FindMetaVertex( c );
217 /* try to find an existing triangle */
218 #ifdef USE_EXHAUSTIVE_SEARCH
224 for( i = 0, tri = metaTriangles; i < numMetaTriangles; i++, tri++ )
226 if( memcmp( src, tri, sizeof( metaTriangle_t ) ) == 0 )
232 /* get a new triangle */
233 triIndex = AddMetaTriangle();
235 /* add the triangle */
236 memcpy( &metaTriangles[ triIndex ], src, sizeof( metaTriangle_t ) );
238 /* return the triangle index */
245 SurfaceToMetaTriangles()
246 converts a classified surface to metatriangles
249 static void SurfaceToMetaTriangles( mapDrawSurface_t *ds )
253 bspDrawVert_t a, b, c;
256 /* only handle certain types of surfaces */
257 if( ds->type != SURFACE_FACE &&
258 ds->type != SURFACE_META &&
259 ds->type != SURFACE_FORCED_META &&
260 ds->type != SURFACE_DECAL )
263 /* speed at the expense of memory */
264 firstSearchMetaVert = numMetaVerts;
266 /* only handle valid surfaces */
267 if( ds->type != SURFACE_BAD && ds->numVerts >= 3 && ds->numIndexes >= 3 )
269 /* walk the indexes and create triangles */
270 for( i = 0; i < ds->numIndexes; i += 3 )
272 /* sanity check the indexes */
273 if( ds->indexes[ i ] == ds->indexes[ i + 1 ] ||
274 ds->indexes[ i ] == ds->indexes[ i + 2 ] ||
275 ds->indexes[ i + 1 ] == ds->indexes[ i + 2 ] )
277 //% Sys_Printf( "%d! ", ds->numVerts );
281 /* build a metatriangle */
282 src.si = ds->shaderInfo;
283 src.side = (ds->sideRef != NULL ? ds->sideRef->side : NULL);
284 src.entityNum = ds->entityNum;
285 src.surfaceNum = ds->surfaceNum;
286 src.planeNum = ds->planeNum;
287 src.castShadows = ds->castShadows;
288 src.recvShadows = ds->recvShadows;
289 src.fogNum = ds->fogNum;
290 src.sampleSize = ds->sampleSize;
291 VectorCopy( ds->lightmapAxis, src.lightmapAxis );
294 memcpy( &a, &ds->verts[ ds->indexes[ i ] ], sizeof( a ) );
295 memcpy( &b, &ds->verts[ ds->indexes[ i + 1 ] ], sizeof( b ) );
296 memcpy( &c, &ds->verts[ ds->indexes[ i + 2 ] ], sizeof( c ) );
297 FindMetaTriangle( &src, &a, &b, &c, ds->planeNum );
304 /* clear the surface (free verts and indexes, sets it to SURFACE_BAD) */
311 TriangulatePatchSurface()
312 creates triangles from a patch
315 void TriangulatePatchSurface( entity_t *e , mapDrawSurface_t *ds )
317 int iterations, x, y, pw[ 5 ], r;
318 mapDrawSurface_t *dsNew;
319 mesh_t src, *subdivided, *mesh;
322 int patchSubdivision;
324 /* vortex: _patchMeta, _patchQuality, _patchSubdivide support */
325 forcePatchMeta = IntForKey(e, "_patchMeta" );
327 forcePatchMeta = IntForKey(e, "patchMeta" );
328 patchQuality = IntForKey(e, "_patchQuality" );
330 patchQuality = IntForKey(e, "patchQuality" );
333 patchSubdivision = IntForKey(e, "_patchSubdivide" );
334 if (!patchSubdivision)
335 patchSubdivision = IntForKey(e, "patchSubdivide" );
337 /* try to early out */
338 if(ds->numVerts == 0 || ds->type != SURFACE_PATCH || ( patchMeta == qfalse && !forcePatchMeta) )
340 /* make a mesh from the drawsurf */
341 src.width = ds->patchWidth;
342 src.height = ds->patchHeight;
343 src.verts = ds->verts;
344 //% subdivided = SubdivideMesh( src, 8, 999 );
345 if (patchSubdivision)
346 iterations = IterationsForCurve( ds->longestCurve, patchSubdivision );
348 iterations = IterationsForCurve( ds->longestCurve, patchSubdivisions / patchQuality );
350 subdivided = SubdivideMesh2( src, iterations ); //% ds->maxIterations
352 /* fit it to the curve and remove colinear verts on rows/columns */
353 PutMeshOnCurve( *subdivided );
354 mesh = RemoveLinearMeshColumnsRows( subdivided );
355 FreeMesh( subdivided );
356 //% MakeMeshNormals( mesh );
358 /* make a copy of the drawsurface */
359 dsNew = AllocDrawSurface( SURFACE_META );
360 memcpy( dsNew, ds, sizeof( *ds ) );
362 /* if the patch is nonsolid, then discard it */
363 if( !(ds->shaderInfo->compileFlags & C_SOLID) )
366 /* set new pointer */
369 /* basic transmogrification */
370 ds->type = SURFACE_META;
372 ds->indexes = safe_malloc( mesh->width * mesh->height * 6 * sizeof( int ) );
374 /* copy the verts in */
375 ds->numVerts = (mesh->width * mesh->height);
376 ds->verts = mesh->verts;
378 /* iterate through the mesh quads */
379 for( y = 0; y < (mesh->height - 1); y++ )
381 for( x = 0; x < (mesh->width - 1); x++ )
384 pw[ 0 ] = x + (y * mesh->width);
385 pw[ 1 ] = x + ((y + 1) * mesh->width);
386 pw[ 2 ] = x + 1 + ((y + 1) * mesh->width);
387 pw[ 3 ] = x + 1 + (y * mesh->width);
388 pw[ 4 ] = x + (y * mesh->width); /* same as pw[ 0 ] */
393 /* make first triangle */
394 ds->indexes[ ds->numIndexes++ ] = pw[ r + 0 ];
395 ds->indexes[ ds->numIndexes++ ] = pw[ r + 1 ];
396 ds->indexes[ ds->numIndexes++ ] = pw[ r + 2 ];
398 /* make second triangle */
399 ds->indexes[ ds->numIndexes++ ] = pw[ r + 0 ];
400 ds->indexes[ ds->numIndexes++ ] = pw[ r + 2 ];
401 ds->indexes[ ds->numIndexes++ ] = pw[ r + 3 ];
405 /* free the mesh, but not the verts */
409 numPatchMetaSurfaces++;
412 ClassifySurfaces( 1, ds );
418 FanFaceSurface() - ydnar
419 creates a tri-fan from a brush face winding
420 loosely based on SurfaceAsTriFan()
423 void FanFaceSurface( mapDrawSurface_t *ds )
425 int i, j, k, a, b, c, color[ MAX_LIGHTMAPS ][ 4 ];
426 bspDrawVert_t *verts, *centroid, *dv;
430 /* try to early out */
431 if( !ds->numVerts || (ds->type != SURFACE_FACE && ds->type != SURFACE_DECAL) )
434 /* add a new vertex at the beginning of the surface */
435 verts = safe_malloc( (ds->numVerts + 1) * sizeof( bspDrawVert_t ) );
436 memset( verts, 0, sizeof( bspDrawVert_t ) );
437 memcpy( &verts[ 1 ], ds->verts, ds->numVerts * sizeof( bspDrawVert_t ) );
441 /* add up the drawverts to create a centroid */
442 centroid = &verts[ 0 ];
443 memset( color, 0, 4 * MAX_LIGHTMAPS * sizeof( int ) );
444 for( i = 1, dv = &verts[ 1 ]; i < (ds->numVerts + 1); i++, dv++ )
446 VectorAdd( centroid->xyz, dv->xyz, centroid->xyz );
447 VectorAdd( centroid->normal, dv->normal, centroid->normal );
448 for( j = 0; j < 4; j++ )
450 for( k = 0; k < MAX_LIGHTMAPS; k++ )
451 color[ k ][ j ] += dv->color[ k ][ j ];
454 centroid->st[ j ] += dv->st[ j ];
455 for( k = 0; k < MAX_LIGHTMAPS; k++ )
456 centroid->lightmap[ k ][ j ] += dv->lightmap[ k ][ j ];
461 /* average the centroid */
462 iv = 1.0f / ds->numVerts;
463 VectorScale( centroid->xyz, iv, centroid->xyz );
464 if( VectorNormalize( centroid->normal, centroid->normal ) <= 0 )
465 VectorCopy( verts[ 1 ].normal, centroid->normal );
466 for( j = 0; j < 4; j++ )
468 for( k = 0; k < MAX_LIGHTMAPS; k++ )
470 color[ k ][ j ] /= ds->numVerts;
471 centroid->color[ k ][ j ] = (color[ k ][ j ] < 255.0f ? color[ k ][ j ] : 255);
475 centroid->st[ j ] *= iv;
476 for( k = 0; k < MAX_LIGHTMAPS; k++ )
477 centroid->lightmap[ k ][ j ] *= iv;
481 /* add to vert count */
484 /* fill indexes in triangle fan order */
486 ds->indexes = safe_malloc( ds->numVerts * 3 * sizeof( int ) );
487 for( i = 1; i < ds->numVerts; i++ )
491 c = (i + 1) % ds->numVerts;
493 ds->indexes[ ds->numIndexes++ ] = a;
494 ds->indexes[ ds->numIndexes++ ] = b;
495 ds->indexes[ ds->numIndexes++ ] = c;
502 ClassifySurfaces( 1, ds );
508 StripFaceSurface() - ydnar
509 attempts to create a valid tri-strip w/o degenerate triangles from a brush face winding
510 based on SurfaceAsTriStrip()
513 #define MAX_INDEXES 1024
515 void StripFaceSurface( mapDrawSurface_t *ds )
517 int i, r, least, rotate, numIndexes, ni, a, b, c, indexes[ MAX_INDEXES ];
521 /* try to early out */
522 if( !ds->numVerts || (ds->type != SURFACE_FACE && ds->type != SURFACE_DECAL) )
525 /* is this a simple triangle? */
526 if( ds->numVerts == 3 )
529 VectorSet( indexes, 0, 1, 2 );
533 /* ydnar: find smallest coordinate */
535 if( ds->shaderInfo != NULL && ds->shaderInfo->autosprite == qfalse )
537 for( i = 0; i < ds->numVerts; i++ )
540 v1 = ds->verts[ i ].xyz;
541 v2 = ds->verts[ least ].xyz;
544 if( v1[ 0 ] < v2[ 0 ] ||
545 (v1[ 0 ] == v2[ 0 ] && v1[ 1 ] < v2[ 1 ]) ||
546 (v1[ 0 ] == v2[ 0 ] && v1[ 1 ] == v2[ 1 ] && v1[ 2 ] < v2[ 2 ]) )
551 /* determine the triangle strip order */
552 numIndexes = (ds->numVerts - 2) * 3;
553 if( numIndexes > MAX_INDEXES )
554 Error( "MAX_INDEXES exceeded for surface (%d > %d) (%d verts)", numIndexes, MAX_INDEXES, ds->numVerts );
556 /* try all possible orderings of the points looking for a non-degenerate strip order */
557 for( r = 0; r < ds->numVerts; r++ )
560 rotate = (r + least) % ds->numVerts;
562 /* walk the winding in both directions */
563 for( ni = 0, i = 0; i < ds->numVerts - 2 - i; i++ )
566 a = (ds->numVerts - 1 - i + rotate) % ds->numVerts;
567 b = (i + rotate ) % ds->numVerts;
568 c = (ds->numVerts - 2 - i + rotate) % ds->numVerts;
570 /* test this triangle */
571 if( ds->numVerts > 4 && IsTriangleDegenerate( ds->verts, a, b, c ) )
577 /* handle end case */
578 if( i + 1 != ds->numVerts - 1 - i )
581 a = (ds->numVerts - 2 - i + rotate ) % ds->numVerts;
582 b = (i + rotate ) % ds->numVerts;
583 c = (i + 1 + rotate ) % ds->numVerts;
586 if( ds->numVerts > 4 && IsTriangleDegenerate( ds->verts, a, b, c ) )
595 if( ni == numIndexes )
599 /* if any triangle in the strip is degenerate, render from a centered fan point instead */
600 if( ni < numIndexes )
602 FanFaceSurface( ds );
607 /* copy strip triangle indexes */
608 ds->numIndexes = numIndexes;
609 ds->indexes = safe_malloc( ds->numIndexes * sizeof( int ) );
610 memcpy( ds->indexes, indexes, ds->numIndexes * sizeof( int ) );
616 ClassifySurfaces( 1, ds );
622 vortex: prints meta statistics in general output
627 Sys_Printf( "--- EmitMetaStats ---\n" );
628 Sys_Printf( "%9d total meta surfaces\n", numMetaSurfaces );
629 Sys_Printf( "%9d stripped surfaces\n", numStripSurfaces );
630 Sys_Printf( "%9d fanned surfaces\n", numFanSurfaces );
631 Sys_Printf( "%9d patch meta surfaces\n", numPatchMetaSurfaces );
632 Sys_Printf( "%9d meta verts\n", numMetaVerts );
633 Sys_Printf( "%9d meta triangles\n", numMetaTriangles );
637 MakeEntityMetaTriangles()
638 builds meta triangles from brush faces (tristrips and fans)
641 void MakeEntityMetaTriangles( entity_t *e )
643 int i, f, fOld, start;
644 mapDrawSurface_t *ds;
648 Sys_FPrintf( SYS_VRB, "--- MakeEntityMetaTriangles ---\n" );
652 start = I_FloatTime();
654 /* walk the list of surfaces in the entity */
655 for( i = e->firstDrawSurf; i < numMapDrawSurfs; i++ )
658 f = 10 * (i - e->firstDrawSurf) / (numMapDrawSurfs - e->firstDrawSurf);
662 Sys_FPrintf( SYS_VRB, "%d...", f );
666 ds = &mapDrawSurfs[ i ];
667 if( ds->numVerts <= 0 )
670 /* ignore autosprite surfaces */
671 if( ds->shaderInfo->autosprite )
674 /* meta this surface? */
675 if( meta == qfalse && ds->shaderInfo->forceMeta == qfalse )
683 StripFaceSurface( ds );
684 SurfaceToMetaTriangles( ds );
688 TriangulatePatchSurface(e, ds );
691 case SURFACE_TRIANGLES:
694 case SURFACE_FORCED_META:
696 SurfaceToMetaTriangles( ds );
705 if( (numMapDrawSurfs - e->firstDrawSurf) )
706 Sys_FPrintf( SYS_VRB, " (%d)\n", (int) (I_FloatTime() - start) );
708 /* emit some stats */
709 Sys_FPrintf( SYS_VRB, "%9d total meta surfaces\n", numMetaSurfaces );
710 Sys_FPrintf( SYS_VRB, "%9d stripped surfaces\n", numStripSurfaces );
711 Sys_FPrintf( SYS_VRB, "%9d fanned surfaces\n", numFanSurfaces );
712 Sys_FPrintf( SYS_VRB, "%9d patch meta surfaces\n", numPatchMetaSurfaces );
713 Sys_FPrintf( SYS_VRB, "%9d meta verts\n", numMetaVerts );
714 Sys_FPrintf( SYS_VRB, "%9d meta triangles\n", numMetaTriangles );
717 TidyEntitySurfaces( e );
723 PointTriangleIntersect()
724 assuming that all points lie in plane, determine if pt
725 is inside the triangle abc
726 code originally (c) 2001 softSurfer (www.softsurfer.com)
729 #define MIN_OUTSIDE_EPSILON -0.01f
730 #define MAX_OUTSIDE_EPSILON 1.01f
732 static qboolean PointTriangleIntersect( vec3_t pt, vec4_t plane, vec3_t a, vec3_t b, vec3_t c, vec3_t bary )
735 float uu, uv, vv, wu, wv, d;
739 VectorSubtract( b, a, u );
740 VectorSubtract( c, a, v );
741 VectorSubtract( pt, a, w );
744 uu = DotProduct( u, u );
745 uv = DotProduct( u, v );
746 vv = DotProduct( v, v );
747 wu = DotProduct( w, u );
748 wv = DotProduct( w, v );
749 d = uv * uv - uu * vv;
751 /* calculate barycentric coordinates */
752 bary[ 1 ] = (uv * wv - vv * wu) / d;
753 if( bary[ 1 ] < MIN_OUTSIDE_EPSILON || bary[ 1 ] > MAX_OUTSIDE_EPSILON )
755 bary[ 2 ] = (uv * wv - uu * wv) / d;
756 if( bary[ 2 ] < MIN_OUTSIDE_EPSILON || bary[ 2 ] > MAX_OUTSIDE_EPSILON )
758 bary[ 0 ] = 1.0f - (bary[ 1 ] + bary[ 2 ]);
760 /* point is in triangle */
768 sets up an edge structure from a plane and 2 points that the edge ab falls lies in
771 typedef struct edge_s
774 vec_t length, kingpinLength;
780 void CreateEdge( vec4_t plane, vec3_t a, vec3_t b, edge_t *edge )
782 /* copy edge origin */
783 VectorCopy( a, edge->origin );
785 /* create vector aligned with winding direction of edge */
786 VectorSubtract( b, a, edge->edge );
788 if( fabs( edge->edge[ 0 ] ) > fabs( edge->edge[ 1 ] ) && fabs( edge->edge[ 0 ] ) > fabs( edge->edge[ 2 ] ) )
790 else if( fabs( edge->edge[ 1 ] ) > fabs( edge->edge[ 0 ] ) && fabs( edge->edge[ 1 ] ) > fabs( edge->edge[ 2 ] ) )
794 edge->kingpinLength = edge->edge[ edge->kingpin ];
796 VectorNormalize( edge->edge, edge->edge );
797 edge->edge[ 3 ] = DotProduct( a, edge->edge );
798 edge->length = DotProduct( b, edge->edge ) - edge->edge[ 3 ];
800 /* create perpendicular plane that edge lies in */
801 CrossProduct( plane, edge->edge, edge->plane );
802 edge->plane[ 3 ] = DotProduct( a, edge->plane );
809 fixes t-junctions on meta triangles
812 #define TJ_PLANE_EPSILON (1.0f / 8.0f)
813 #define TJ_EDGE_EPSILON (1.0f / 8.0f)
814 #define TJ_POINT_EPSILON (1.0f / 8.0f)
816 void FixMetaTJunctions( void )
818 int i, j, k, f, fOld, start, vertIndex, triIndex, numTJuncs;
819 metaTriangle_t *tri, *newTri;
821 bspDrawVert_t *a, *b, *c, junc;
828 /* this code is crap; revisit later */
832 Sys_FPrintf( SYS_VRB, "--- FixMetaTJunctions ---\n" );
836 start = I_FloatTime();
838 /* walk triangle list */
840 for( i = 0; i < numMetaTriangles; i++ )
843 tri = &metaTriangles[ i ];
846 f = 10 * i / numMetaTriangles;
850 Sys_FPrintf( SYS_VRB, "%d...", f );
853 /* attempt to early out */
855 if( (si->compileFlags & C_NODRAW) || si->autosprite || si->notjunc )
858 /* calculate planes */
859 VectorCopy( tri->plane, plane );
860 plane[ 3 ] = tri->plane[ 3 ];
861 CreateEdge( plane, metaVerts[ tri->indexes[ 0 ] ].xyz, metaVerts[ tri->indexes[ 1 ] ].xyz, &edges[ 0 ] );
862 CreateEdge( plane, metaVerts[ tri->indexes[ 1 ] ].xyz, metaVerts[ tri->indexes[ 2 ] ].xyz, &edges[ 1 ] );
863 CreateEdge( plane, metaVerts[ tri->indexes[ 2 ] ].xyz, metaVerts[ tri->indexes[ 0 ] ].xyz, &edges[ 2 ] );
865 /* walk meta vert list */
866 for( j = 0; j < numMetaVerts; j++ )
869 VectorCopy( metaVerts[ j ].xyz, pt );
871 /* debug code: darken verts */
873 VectorSet( metaVerts[ j ].color[ 0 ], 8, 8, 8 );
875 /* determine if point lies in the triangle's plane */
876 dist = DotProduct( pt, plane ) - plane[ 3 ];
877 if( fabs( dist ) > TJ_PLANE_EPSILON )
880 /* skip this point if it already exists in the triangle */
881 for( k = 0; k < 3; k++ )
883 if( fabs( pt[ 0 ] - metaVerts[ tri->indexes[ k ] ].xyz[ 0 ] ) <= TJ_POINT_EPSILON &&
884 fabs( pt[ 1 ] - metaVerts[ tri->indexes[ k ] ].xyz[ 1 ] ) <= TJ_POINT_EPSILON &&
885 fabs( pt[ 2 ] - metaVerts[ tri->indexes[ k ] ].xyz[ 2 ] ) <= TJ_POINT_EPSILON )
892 for( k = 0; k < 3; k++ )
894 /* ignore bogus edges */
895 if( fabs( edges[ k ].kingpinLength ) < TJ_EDGE_EPSILON )
898 /* determine if point lies on the edge */
899 dist = DotProduct( pt, edges[ k ].plane ) - edges[ k ].plane[ 3 ];
900 if( fabs( dist ) > TJ_EDGE_EPSILON )
903 /* determine how far along the edge the point lies */
904 amount = (pt[ edges[ k ].kingpin ] - edges[ k ].origin[ edges[ k ].kingpin ]) / edges[ k ].kingpinLength;
905 if( amount <= 0.0f || amount >= 1.0f )
909 dist = DotProduct( pt, edges[ k ].edge ) - edges[ k ].edge[ 3 ];
910 if( dist <= -0.0f || dist >= edges[ k ].length )
912 amount = dist / edges[ k ].length;
915 /* debug code: brighten this point */
916 //% metaVerts[ j ].color[ 0 ][ 0 ] += 5;
917 //% metaVerts[ j ].color[ 0 ][ 1 ] += 4;
918 VectorSet( metaVerts[ tri->indexes[ k ] ].color[ 0 ], 255, 204, 0 );
919 VectorSet( metaVerts[ tri->indexes[ (k + 1) % 3 ] ].color[ 0 ], 255, 204, 0 );
922 /* the edge opposite the zero-weighted vertex was hit, so use that as an amount */
923 a = &metaVerts[ tri->indexes[ k % 3 ] ];
924 b = &metaVerts[ tri->indexes[ (k + 1) % 3 ] ];
925 c = &metaVerts[ tri->indexes[ (k + 2) % 3 ] ];
928 LerpDrawVertAmount( a, b, amount, &junc );
929 VectorCopy( pt, junc.xyz );
931 /* compare against existing verts */
932 if( VectorCompare( junc.xyz, a->xyz ) || VectorCompare( junc.xyz, b->xyz ) || VectorCompare( junc.xyz, c->xyz ) )
935 /* see if we can just re-use the existing vert */
936 if( !memcmp( &metaVerts[ j ], &junc, sizeof( junc ) ) )
940 /* find new vertex (note: a and b are invalid pointers after this) */
941 firstSearchMetaVert = numMetaVerts;
942 vertIndex = FindMetaVertex( &junc );
947 /* make new triangle */
948 triIndex = AddMetaTriangle();
953 tri = &metaTriangles[ i ];
954 newTri = &metaTriangles[ triIndex ];
956 /* copy the triangle */
957 memcpy( newTri, tri, sizeof( *tri ) );
960 tri->indexes[ (k + 1) % 3 ] = vertIndex;
961 newTri->indexes[ k ] = vertIndex;
963 /* recalculate edges */
964 CreateEdge( plane, metaVerts[ tri->indexes[ 0 ] ].xyz, metaVerts[ tri->indexes[ 1 ] ].xyz, &edges[ 0 ] );
965 CreateEdge( plane, metaVerts[ tri->indexes[ 1 ] ].xyz, metaVerts[ tri->indexes[ 2 ] ].xyz, &edges[ 1 ] );
966 CreateEdge( plane, metaVerts[ tri->indexes[ 2 ] ].xyz, metaVerts[ tri->indexes[ 0 ] ].xyz, &edges[ 2 ] );
969 metaVerts[ vertIndex ].color[ 0 ][ 0 ] = 255;
970 metaVerts[ vertIndex ].color[ 0 ][ 1 ] = 204;
971 metaVerts[ vertIndex ].color[ 0 ][ 2 ] = 0;
973 /* add to counter and end processing of this vert */
981 Sys_FPrintf( SYS_VRB, " (%d)\n", (int) (I_FloatTime() - start) );
983 /* emit some stats */
984 Sys_FPrintf( SYS_VRB, "%9d T-junctions added\n", numTJuncs );
990 SmoothMetaTriangles()
991 averages coincident vertex normals in the meta triangles
994 #define MAX_SAMPLES 256
995 #define THETA_EPSILON 0.000001
996 #define EQUAL_NORMAL_EPSILON 0.01
998 void SmoothMetaTriangles( void )
1000 int i, j, k, f, fOld, start, cs, numVerts, numVotes, numSmoothed;
1001 float shadeAngle, defaultShadeAngle, maxShadeAngle, dot, testAngle;
1002 metaTriangle_t *tri;
1005 vec3_t average, diff;
1006 int indexes[ MAX_SAMPLES ];
1007 vec3_t votes[ MAX_SAMPLES ];
1008 const char *classname;
1011 Sys_FPrintf( SYS_VRB, "--- SmoothMetaTriangles ---\n" );
1013 /* allocate shade angle table */
1014 shadeAngles = safe_malloc( numMetaVerts * sizeof( float ) );
1015 memset( shadeAngles, 0, numMetaVerts * sizeof( float ) );
1017 /* allocate smoothed table */
1018 cs = (numMetaVerts / 8) + 1;
1019 smoothed = safe_malloc( cs );
1020 memset( smoothed, 0, cs );
1022 /* set default shade angle */
1023 defaultShadeAngle = DEG2RAD( npDegrees );
1024 maxShadeAngle = 0.0f;
1026 /* run through every surface and flag verts belonging to non-lightmapped surfaces
1027 and set per-vertex smoothing angle */
1028 for( i = 0, tri = &metaTriangles[ i ]; i < numMetaTriangles; i++, tri++ )
1030 /* vortex: try get smoothing from entity key */
1031 shadeAngle = FloatForKey(&entities[tri->entityNum], "_shadeangle");
1032 if (shadeAngle <= 0.0f)
1033 shadeAngle = FloatForKey(&entities[tri->entityNum], "_smoothnormals");
1034 if (shadeAngle <= 0.0f)
1035 shadeAngle = FloatForKey(&entities[tri->entityNum], "_sn");
1036 if (shadeAngle <= 0.0f)
1037 shadeAngle = FloatForKey(&entities[tri->entityNum], "_smooth");
1038 if (shadeAngle > 0.0f)
1040 if (entities[tri->entityNum].forceNormalSmoothing == qfalse)
1042 entities[tri->entityNum].forceNormalSmoothing = qtrue;
1043 classname = ValueForKey( &entities[tri->entityNum], "classname" );
1044 Sys_Printf( "Entity %d (%s) has vertex normal smoothing with breaking angle of %3.0f\n", tri->entityNum, classname, shadeAngle );
1046 shadeAngle = DEG2RAD( shadeAngle );
1049 /* get shader for shade angle */
1050 if (shadeAngle <= 0.0f)
1052 if( tri->si->shadeAngleDegrees > 0.0f )
1053 shadeAngle = DEG2RAD( tri->si->shadeAngleDegrees );
1055 shadeAngle = defaultShadeAngle;
1057 if( shadeAngle > maxShadeAngle )
1058 maxShadeAngle = shadeAngle;
1060 /* flag its verts */
1061 for( j = 0; j < 3; j++ )
1063 shadeAngles[ tri->indexes[ j ] ] = shadeAngle;
1064 if( shadeAngle <= 0 )
1065 smoothed[ tri->indexes[ j ] >> 3 ] |= (1 << (tri->indexes[ j ] & 7));
1069 /* bail if no surfaces have a shade angle */
1070 if( maxShadeAngle <= 0 )
1072 Sys_FPrintf( SYS_VRB, "No smoothing angles specified, aborting\n" );
1073 free( shadeAngles );
1080 start = I_FloatTime();
1082 /* go through the list of vertexes */
1084 for( i = 0; i < numMetaVerts; i++ )
1086 /* print pacifier */
1087 f = 10 * i / numMetaVerts;
1091 Sys_FPrintf( SYS_VRB, "%d...", f );
1094 /* already smoothed? */
1095 if( smoothed[ i >> 3 ] & (1 << (i & 7)) )
1099 VectorClear( average );
1103 /* build a table of coincident vertexes */
1104 for( j = i; j < numMetaVerts && numVerts < MAX_SAMPLES; j++ )
1106 /* already smoothed? */
1107 if( smoothed[ j >> 3 ] & (1 << (j & 7)) )
1111 if( VectorCompare( metaVerts[ i ].xyz, metaVerts[ j ].xyz ) == qfalse )
1114 /* use smallest shade angle */
1115 shadeAngle = (shadeAngles[ i ] < shadeAngles[ j ] ? shadeAngles[ i ] : shadeAngles[ j ]);
1117 /* check shade angle */
1118 dot = DotProduct( metaVerts[ i ].normal, metaVerts[ j ].normal );
1121 else if( dot < -1.0 )
1123 testAngle = acos( dot ) + THETA_EPSILON;
1124 if( testAngle >= shadeAngle )
1127 /* add to the list */
1128 indexes[ numVerts++ ] = j;
1131 smoothed[ j >> 3 ] |= (1 << (j & 7));
1133 /* see if this normal has already been voted */
1134 for( k = 0; k < numVotes; k++ )
1136 VectorSubtract( metaVerts[ j ].normal, votes[ k ], diff );
1137 if( fabs( diff[ 0 ] ) < EQUAL_NORMAL_EPSILON &&
1138 fabs( diff[ 1 ] ) < EQUAL_NORMAL_EPSILON &&
1139 fabs( diff[ 2 ] ) < EQUAL_NORMAL_EPSILON )
1143 /* add a new vote? */
1144 if( k == numVotes && numVotes < MAX_SAMPLES )
1146 VectorAdd( average, metaVerts[ j ].normal, average );
1147 VectorCopy( metaVerts[ j ].normal, votes[ numVotes ] );
1152 /* don't average for less than 2 verts */
1156 /* average normal */
1157 if( VectorNormalize( average, average ) > 0 )
1160 for( j = 0; j < numVerts; j++ )
1161 VectorCopy( average, metaVerts[ indexes[ j ] ].normal );
1166 /* free the tables */
1167 free( shadeAngles );
1171 Sys_FPrintf( SYS_VRB, " (%d)\n", (int) (I_FloatTime() - start) );
1173 /* emit some stats */
1174 Sys_FPrintf( SYS_VRB, "%9d smoothed vertexes\n", numSmoothed );
1180 AddMetaVertToSurface()
1181 adds a drawvert to a surface unless an existing vert matching already exists
1182 returns the index of that vert (or < 0 on failure)
1185 int AddMetaVertToSurface( mapDrawSurface_t *ds, bspDrawVert_t *dv1, int *coincident )
1191 /* go through the verts and find a suitable candidate */
1192 for( i = 0; i < ds->numVerts; i++ )
1195 dv2 = &ds->verts[ i ];
1197 /* compare xyz and normal */
1198 if( VectorCompare( dv1->xyz, dv2->xyz ) == qfalse )
1200 if( VectorCompare( dv1->normal, dv2->normal ) == qfalse )
1203 /* good enough at this point */
1206 /* compare texture coordinates and color */
1207 if( dv1->st[ 0 ] != dv2->st[ 0 ] || dv1->st[ 1 ] != dv2->st[ 1 ] )
1209 if( dv1->color[ 0 ][ 3 ] != dv2->color[ 0 ][ 3 ] )
1212 /* found a winner */
1217 /* overflow check */
1218 if( ds->numVerts >= ((ds->shaderInfo->compileFlags & C_VERTEXLIT) ? maxSurfaceVerts : maxLMSurfaceVerts) )
1219 return VERTS_EXCEEDED;
1221 /* made it this far, add the vert and return */
1222 dv2 = &ds->verts[ ds->numVerts++ ];
1224 return (ds->numVerts - 1);
1231 AddMetaTriangleToSurface()
1232 attempts to add a metatriangle to a surface
1233 returns the score of the triangle added
1236 #define AXIS_SCORE 100000
1237 #define AXIS_MIN 100000
1238 #define VERT_SCORE 10000
1239 #define SURFACE_SCORE 1000
1241 #define ST_SCORE2 (2 * (ST_SCORE))
1243 #define ADEQUATE_SCORE ((AXIS_MIN) + 1 * (VERT_SCORE))
1244 #define GOOD_SCORE ((AXIS_MIN) + 2 * (VERT_SCORE) + 4 * (ST_SCORE))
1245 #define PERFECT_SCORE ((AXIS_MIN) + + 3 * (VERT_SCORE) + (SURFACE_SCORE) + 4 * (ST_SCORE))
1247 static int AddMetaTriangleToSurface( mapDrawSurface_t *ds, metaTriangle_t *tri, qboolean testAdd )
1249 int i, score, coincident, ai, bi, ci, oldTexRange[ 2 ];
1252 qboolean inTexRange, es, et;
1253 mapDrawSurface_t old;
1256 /* overflow check */
1257 if( ds->numIndexes >= maxSurfaceIndexes )
1260 /* test the triangle */
1261 if( ds->entityNum != tri->entityNum ) /* ydnar: added 2002-07-06 */
1263 if( ds->castShadows != tri->castShadows || ds->recvShadows != tri->recvShadows )
1265 if( ds->shaderInfo != tri->si || ds->fogNum != tri->fogNum || ds->sampleSize != tri->sampleSize )
1268 if( !(ds->shaderInfo->compileFlags & C_VERTEXLIT) &&
1269 //% VectorCompare( ds->lightmapAxis, tri->lightmapAxis ) == qfalse )
1270 DotProduct( ds->lightmapAxis, tri->plane ) < 0.25f )
1274 /* planar surfaces will only merge with triangles in the same plane */
1275 if( npDegrees == 0.0f && ds->shaderInfo->nonplanar == qfalse && ds->planeNum >= 0 )
1277 if( VectorCompare( mapplanes[ ds->planeNum ].normal, tri->plane ) == qfalse || mapplanes[ ds->planeNum ].dist != tri->plane[ 3 ] )
1279 if( tri->planeNum >= 0 && tri->planeNum != ds->planeNum )
1283 /* set initial score */
1284 score = tri->surfaceNum == ds->surfaceNum ? SURFACE_SCORE : 0;
1286 /* score the the dot product of lightmap axis to plane */
1287 if( (ds->shaderInfo->compileFlags & C_VERTEXLIT) || VectorCompare( ds->lightmapAxis, tri->lightmapAxis ) )
1288 score += AXIS_SCORE;
1290 score += AXIS_SCORE * DotProduct( ds->lightmapAxis, tri->plane );
1292 /* preserve old drawsurface if this fails */
1293 memcpy( &old, ds, sizeof( *ds ) );
1295 /* attempt to add the verts */
1297 ai = AddMetaVertToSurface( ds, &metaVerts[ tri->indexes[ 0 ] ], &coincident );
1298 bi = AddMetaVertToSurface( ds, &metaVerts[ tri->indexes[ 1 ] ], &coincident );
1299 ci = AddMetaVertToSurface( ds, &metaVerts[ tri->indexes[ 2 ] ], &coincident );
1301 /* check vertex underflow */
1302 if( ai < 0 || bi < 0 || ci < 0 )
1304 memcpy( ds, &old, sizeof( *ds ) );
1308 /* score coincident vertex count (2003-02-14: changed so this only matters on planar surfaces) */
1309 score += (coincident * VERT_SCORE);
1311 /* add new vertex bounds to mins/maxs */
1312 VectorCopy( ds->mins, mins );
1313 VectorCopy( ds->maxs, maxs );
1314 AddPointToBounds( metaVerts[ tri->indexes[ 0 ] ].xyz, mins, maxs );
1315 AddPointToBounds( metaVerts[ tri->indexes[ 1 ] ].xyz, mins, maxs );
1316 AddPointToBounds( metaVerts[ tri->indexes[ 2 ] ].xyz, mins, maxs );
1318 /* check lightmap bounds overflow (after at least 1 triangle has been added) */
1319 if( !(ds->shaderInfo->compileFlags & C_VERTEXLIT) &&
1320 ds->numIndexes > 0 && VectorLength( ds->lightmapAxis ) > 0.0f &&
1321 (VectorCompare( ds->mins, mins ) == qfalse || VectorCompare( ds->maxs, maxs ) == qfalse) )
1323 /* set maximum size before lightmap scaling (normally 2032 units) */
1324 /* 2004-02-24: scale lightmap test size by 2 to catch larger brush faces */
1325 /* 2004-04-11: reverting to actual lightmap size */
1326 lmMax = (ds->sampleSize * (ds->shaderInfo->lmCustomWidth - 1));
1327 for( i = 0; i < 3; i++ )
1329 if( (maxs[ i ] - mins[ i ]) > lmMax )
1331 memcpy( ds, &old, sizeof( *ds ) );
1337 /* check texture range overflow */
1338 oldTexRange[ 0 ] = ds->texRange[ 0 ];
1339 oldTexRange[ 1 ] = ds->texRange[ 1 ];
1340 inTexRange = CalcSurfaceTextureRange( ds );
1342 es = (ds->texRange[ 0 ] > oldTexRange[ 0 ]) ? qtrue : qfalse;
1343 et = (ds->texRange[ 1 ] > oldTexRange[ 1 ]) ? qtrue : qfalse;
1345 if( inTexRange == qfalse && ds->numIndexes > 0 )
1347 memcpy( ds, &old, sizeof( *ds ) );
1348 return UNSUITABLE_TRIANGLE;
1351 /* score texture range */
1352 if( ds->texRange[ 0 ] <= oldTexRange[ 0 ] )
1354 else if( ds->texRange[ 0 ] > oldTexRange[ 0 ] && oldTexRange[ 1 ] > oldTexRange[ 0 ] )
1357 if( ds->texRange[ 1 ] <= oldTexRange[ 1 ] )
1359 else if( ds->texRange[ 1 ] > oldTexRange[ 1 ] && oldTexRange[ 0 ] > oldTexRange[ 1 ] )
1363 /* go through the indexes and try to find an existing triangle that matches abc */
1364 for( i = 0; i < ds->numIndexes; i += 3 )
1366 /* 2002-03-11 (birthday!): rotate the triangle 3x to find an existing triangle */
1367 if( (ai == ds->indexes[ i ] && bi == ds->indexes[ i + 1 ] && ci == ds->indexes[ i + 2 ]) ||
1368 (bi == ds->indexes[ i ] && ci == ds->indexes[ i + 1 ] && ai == ds->indexes[ i + 2 ]) ||
1369 (ci == ds->indexes[ i ] && ai == ds->indexes[ i + 1 ] && bi == ds->indexes[ i + 2 ]) )
1371 /* triangle already present */
1372 memcpy( ds, &old, sizeof( *ds ) );
1377 /* rotate the triangle 3x to find an inverse triangle (error case) */
1378 if( (ai == ds->indexes[ i ] && bi == ds->indexes[ i + 2 ] && ci == ds->indexes[ i + 1 ]) ||
1379 (bi == ds->indexes[ i ] && ci == ds->indexes[ i + 2 ] && ai == ds->indexes[ i + 1 ]) ||
1380 (ci == ds->indexes[ i ] && ai == ds->indexes[ i + 2 ] && bi == ds->indexes[ i + 1 ]) )
1383 Sys_Printf( "WARNING: Flipped triangle: (%6.0f %6.0f %6.0f) (%6.0f %6.0f %6.0f) (%6.0f %6.0f %6.0f)\n",
1384 ds->verts[ ai ].xyz[ 0 ], ds->verts[ ai ].xyz[ 1 ], ds->verts[ ai ].xyz[ 2 ],
1385 ds->verts[ bi ].xyz[ 0 ], ds->verts[ bi ].xyz[ 1 ], ds->verts[ bi ].xyz[ 2 ],
1386 ds->verts[ ci ].xyz[ 0 ], ds->verts[ ci ].xyz[ 1 ], ds->verts[ ci ].xyz[ 2 ] );
1388 /* reverse triangle already present */
1389 memcpy( ds, &old, sizeof( *ds ) );
1395 /* add the triangle indexes */
1396 if( ds->numIndexes < maxSurfaceIndexes )
1397 ds->indexes[ ds->numIndexes++ ] = ai;
1398 if( ds->numIndexes < maxSurfaceIndexes )
1399 ds->indexes[ ds->numIndexes++ ] = bi;
1400 if( ds->numIndexes < maxSurfaceIndexes )
1401 ds->indexes[ ds->numIndexes++ ] = ci;
1403 /* check index overflow */
1404 if( ds->numIndexes >= maxSurfaceIndexes )
1406 memcpy( ds, &old, sizeof( *ds ) );
1410 /* sanity check the indexes */
1411 if( ds->numIndexes >= 3 &&
1412 (ds->indexes[ ds->numIndexes - 3 ] == ds->indexes[ ds->numIndexes - 2 ] ||
1413 ds->indexes[ ds->numIndexes - 3 ] == ds->indexes[ ds->numIndexes - 1 ] ||
1414 ds->indexes[ ds->numIndexes - 2 ] == ds->indexes[ ds->numIndexes - 1 ]) )
1415 Sys_Printf( "DEG:%d! ", ds->numVerts );
1419 memcpy( ds, &old, sizeof( *ds ) );
1422 /* copy bounds back to surface */
1423 VectorCopy( mins, ds->mins );
1424 VectorCopy( maxs, ds->maxs );
1426 /* mark triangle as used */
1430 /* add a side reference */
1431 ds->sideRef = AllocSideRef( tri->side, ds->sideRef );
1433 /* return to sender */
1440 MetaTrianglesToSurface()
1441 creates map drawsurface(s) from the list of possibles
1444 static void MetaTrianglesToSurface( int numPossibles, metaTriangle_t *possibles, int *fOld, int *numAdded )
1446 int i, j, f, best, score, bestScore;
1447 metaTriangle_t *seed, *test;
1448 mapDrawSurface_t *ds;
1449 bspDrawVert_t *verts;
1454 /* allocate arrays */
1455 verts = safe_malloc( sizeof( *verts ) * maxSurfaceVerts );
1456 indexes = safe_malloc( sizeof( *indexes ) * maxSurfaceIndexes );
1458 /* walk the list of triangles */
1459 for( i = 0, seed = possibles; i < numPossibles; i++, seed++ )
1461 /* skip this triangle if it has already been merged */
1462 if( seed->si == NULL )
1465 /* -----------------------------------------------------------------
1466 initial drawsurf construction
1467 ----------------------------------------------------------------- */
1469 /* start a new drawsurface */
1470 ds = AllocDrawSurface( SURFACE_META );
1471 ds->entityNum = seed->entityNum;
1472 ds->surfaceNum = seed->surfaceNum;
1473 ds->castShadows = seed->castShadows;
1474 ds->recvShadows = seed->recvShadows;
1476 ds->shaderInfo = seed->si;
1477 ds->planeNum = seed->planeNum;
1478 ds->fogNum = seed->fogNum;
1479 ds->sampleSize = seed->sampleSize;
1481 ds->indexes = indexes;
1482 VectorCopy( seed->lightmapAxis, ds->lightmapAxis );
1483 ds->sideRef = AllocSideRef( seed->side, NULL );
1485 ClearBounds( ds->mins, ds->maxs );
1487 /* clear verts/indexes */
1488 memset( verts, 0, sizeof( verts ) );
1489 memset( indexes, 0, sizeof( indexes ) );
1491 /* add the first triangle */
1492 if( AddMetaTriangleToSurface( ds, seed, qfalse ) )
1495 /* -----------------------------------------------------------------
1497 ----------------------------------------------------------------- */
1499 /* progressively walk the list until no more triangles can be added */
1503 /* print pacifier */
1504 f = 10 * *numAdded / numMetaTriangles;
1508 Sys_FPrintf( SYS_VRB, "%d...", f );
1511 /* reset best score */
1516 /* walk the list of possible candidates for merging */
1517 for( j = i + 1, test = &possibles[ j ]; j < numPossibles; j++, test++ )
1519 /* skip this triangle if it has already been merged */
1520 if( test->si == NULL )
1523 /* score this triangle */
1524 score = AddMetaTriangleToSurface( ds, test, qtrue );
1525 if( score > bestScore )
1530 /* if we have a score over a certain threshold, just use it */
1531 if( bestScore >= GOOD_SCORE )
1533 if( AddMetaTriangleToSurface( ds, &possibles[ best ], qfalse ) )
1544 /* add best candidate */
1545 if( best >= 0 && bestScore > ADEQUATE_SCORE )
1547 if( AddMetaTriangleToSurface( ds, &possibles[ best ], qfalse ) )
1555 /* copy the verts and indexes to the new surface */
1556 ds->verts = safe_malloc( ds->numVerts * sizeof( bspDrawVert_t ) );
1557 memcpy( ds->verts, verts, ds->numVerts * sizeof( bspDrawVert_t ) );
1558 ds->indexes = safe_malloc( ds->numIndexes * sizeof( int ) );
1559 memcpy( ds->indexes, indexes, ds->numIndexes * sizeof( int ) );
1561 /* classify the surface */
1562 ClassifySurfaces( 1, ds );
1565 numMergedSurfaces++;
1576 CompareMetaTriangles()
1577 compare function for qsort()
1580 static int CompareMetaTriangles( const void *a, const void *b )
1583 vec3_t aMins, bMins;
1587 if( ((metaTriangle_t*) a)->si < ((metaTriangle_t*) b)->si )
1589 else if( ((metaTriangle_t*) a)->si > ((metaTriangle_t*) b)->si )
1593 else if( ((metaTriangle_t*) a)->fogNum < ((metaTriangle_t*) b)->fogNum )
1595 else if( ((metaTriangle_t*) a)->fogNum > ((metaTriangle_t*) b)->fogNum )
1600 else if( npDegrees == 0.0f && ((metaTriangle_t*) a)->si->nonplanar == qfalse &&
1601 ((metaTriangle_t*) a)->planeNum >= 0 && ((metaTriangle_t*) a)->planeNum >= 0 )
1603 if( ((metaTriangle_t*) a)->plane[ 3 ] < ((metaTriangle_t*) b)->plane[ 3 ] )
1605 else if( ((metaTriangle_t*) a)->plane[ 3 ] > ((metaTriangle_t*) b)->plane[ 3 ] )
1607 else if( ((metaTriangle_t*) a)->plane[ 0 ] < ((metaTriangle_t*) b)->plane[ 0 ] )
1609 else if( ((metaTriangle_t*) a)->plane[ 0 ] > ((metaTriangle_t*) b)->plane[ 0 ] )
1611 else if( ((metaTriangle_t*) a)->plane[ 1 ] < ((metaTriangle_t*) b)->plane[ 1 ] )
1613 else if( ((metaTriangle_t*) a)->plane[ 1 ] > ((metaTriangle_t*) b)->plane[ 1 ] )
1615 else if( ((metaTriangle_t*) a)->plane[ 2 ] < ((metaTriangle_t*) b)->plane[ 2 ] )
1617 else if( ((metaTriangle_t*) a)->plane[ 2 ] > ((metaTriangle_t*) b)->plane[ 2 ] )
1622 /* then position in world */
1625 VectorSet( aMins, 999999, 999999, 999999 );
1626 VectorSet( bMins, 999999, 999999, 999999 );
1627 for( i = 0; i < 3; i++ )
1629 av = ((metaTriangle_t*) a)->indexes[ i ];
1630 bv = ((metaTriangle_t*) b)->indexes[ i ];
1631 for( j = 0; j < 3; j++ )
1633 if( metaVerts[ av ].xyz[ j ] < aMins[ j ] )
1634 aMins[ j ] = metaVerts[ av ].xyz[ j ];
1635 if( metaVerts[ bv ].xyz[ j ] < bMins[ j ] )
1636 bMins[ j ] = metaVerts[ bv ].xyz[ j ];
1641 for( i = 0; i < 3; i++ )
1643 if( aMins[ i ] < bMins[ i ] )
1645 else if( aMins[ i ] > bMins[ i ] )
1649 /* functionally equivalent */
1656 MergeMetaTriangles()
1657 merges meta triangles into drawsurfaces
1660 void MergeMetaTriangles( void )
1662 int i, j, fOld, start, numAdded;
1663 metaTriangle_t *head, *end;
1666 /* only do this if there are meta triangles */
1667 if( numMetaTriangles <= 0 )
1671 Sys_FPrintf( SYS_VRB, "--- MergeMetaTriangles ---\n" );
1673 /* sort the triangles by shader major, fognum minor */
1674 qsort( metaTriangles, numMetaTriangles, sizeof( metaTriangle_t ), CompareMetaTriangles );
1678 start = I_FloatTime();
1682 for( i = 0, j = 0; i < numMetaTriangles; i = j )
1684 /* get head of list */
1685 head = &metaTriangles[ i ];
1687 /* skip this triangle if it has already been merged */
1688 if( head->si == NULL )
1694 for( j = i + 1; j < numMetaTriangles; j++ )
1696 /* get end of list */
1697 end = &metaTriangles[ j ];
1698 if( head->si != end->si || head->fogNum != end->fogNum )
1703 /* try to merge this list of possible merge candidates */
1704 MetaTrianglesToSurface( (j - i), head, &fOld, &numAdded );
1707 /* clear meta triangle list */
1708 ClearMetaTriangles();
1712 Sys_FPrintf( SYS_VRB, " (%d)\n", (int) (I_FloatTime() - start) );
1714 /* emit some stats */
1715 Sys_FPrintf( SYS_VRB, "%9d surfaces merged\n", numMergedSurfaces );
1716 Sys_FPrintf( SYS_VRB, "%9d vertexes merged\n", numMergedVerts );