2 Copyright (C) 1999-2006 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
25 polyset_t *Polyset_SplitSets( polyset_t *psets, int numpolysets, int *pNumNewPolysets, int maxTris )
28 int numNewPolysets = 0;
29 int numSplitPolysets = 0;
33 for ( p = 0; p < numpolysets; p++ )
35 numNewPolysets += psets[p].numtriangles / maxTris + 1;
38 if ( numNewPolysets == numpolysets )
41 printf( "Warning: creating %d polysets from input of %d polysets\n", numNewPolysets, numpolysets );
43 newpsets = calloc( sizeof( polyset_t ) * numNewPolysets, 1 );
45 for ( np = 0, op = 0; op < numpolysets; op++ )
47 numSplitPolysets = ( psets[op].numtriangles / ( maxTris + 1 ) ) + 1;
48 if ( numSplitPolysets == 1 )
50 memcpy( &newpsets[np], &psets[op], sizeof( polyset_t ) );
57 // split this pset into multiple smaller psets
58 for ( p = 0; p < numSplitPolysets; p++, np++ )
60 memcpy( &newpsets[np], &psets[op], sizeof( polyset_t ) );
62 newpsets[np].triangles = psets[op].triangles + sumTriangles;
64 if ( sumTriangles + maxTris > psets[op].numtriangles )
65 newpsets[np].numtriangles = psets[op].numtriangles - sumTriangles;
67 newpsets[np].numtriangles = maxTris;
69 sumTriangles += newpsets[np].numtriangles;
74 *pNumNewPolysets = numNewPolysets;
79 polyset_t *Polyset_LoadSets( const char *file, int *numpolysets, int maxTrisPerSet )
82 polyset_t *finalpsets;
87 if ( strstr( file, ".3DS" ) || strstr( file, ".3ds" ) )
88 _3DS_LoadPolysets( file, &psets, numpolysets, g_verbose );
90 Error( "TRI files no longer supported" );
91 // TRI_LoadPolysets( file, &psets, numpolysets );
97 for ( i = 0; i < psets; i++ )
101 for ( j = 0; j < psets[i].numtriangles; j++ )
108 // split polysets if necessary
110 finalpsets = Polyset_SplitSets( psets, *numpolysets, numpolysets, maxTrisPerSet );
115 polyset_t *Polyset_CollapseSets( polyset_t *psets, int numpolysets )
118 int sumtriangles = 0;
120 polyset_t *oldpsets = psets;
123 // no tag checking because this is an $oldbase and thus shouldn't have any
126 for ( p = 0; p < numpolysets; p++ )
128 sumtriangles += oldpsets[p].numtriangles;
131 psets = calloc( 1, sizeof( polyset_t ) );
132 psets[0].numtriangles = sumtriangles;
133 psets[0].triangles = malloc( MD3_MAX_TRIANGLES * sizeof( triangle_t ) );
135 // each call to "LoadPolysets" only allocates a single large chunk of
136 // triangle memory that is utilized by all the polysets loaded by
138 memcpy( psets[0].triangles, oldpsets[0].triangles, sizeof( triangle_t ) * sumtriangles );
140 free( oldpsets[0].triangles );
146 static float SnapFloat( float x )
150 x *= 1.0f / MD3_XYZ_SCALE;
158 void Polyset_SnapSets( polyset_t *psets, int numpolysets )
162 for ( p = 0; p < numpolysets; p++ )
166 for ( t = 0; t < psets[p].numtriangles; t++ )
170 for ( v = 0; v < 3; v++ )
172 psets[p].triangles[t].verts[v][0] = SnapFloat( psets[p].triangles[t].verts[v][0] );
173 psets[p].triangles[t].verts[v][1] = SnapFloat( psets[p].triangles[t].verts[v][1] );
174 psets[p].triangles[t].verts[v][2] = SnapFloat( psets[p].triangles[t].verts[v][2] );
180 void Polyset_ComputeNormals( polyset_t *psets, int numpolysets )
184 int vertexIndex[MD3_MAX_TRIANGLES][3];
185 vec3_t verts[MD3_MAX_VERTS];
186 vec3_t normals[MD3_MAX_VERTS];
187 vec3_t faceNormals[MD3_MAX_TRIANGLES];
190 // iterate through polysets
192 for ( p = 0; p < numpolysets; p++ )
194 int numUniqueVertices = 0;
196 assert( psets[p].numtriangles < MD3_MAX_TRIANGLES );
198 memset( vertexIndex, 0xff, sizeof( vertexIndex ) );
199 memset( verts, 0, sizeof( verts ) );
200 memset( normals, 0, sizeof( normals ) );
205 for ( t = 0; t < psets[p].numtriangles; t++ )
209 for ( j = 0; j < 3; j++ )
211 for ( i = 0; i < numUniqueVertices; i++ )
213 if ( VectorCompare( psets[p].triangles[t].verts[j], verts[i] ) )
218 if ( i == numUniqueVertices )
220 vertexIndex[t][j] = numUniqueVertices;
221 VectorCopy( (psets[p].triangles[t].verts[j]), (verts[numUniqueVertices]) );
226 vertexIndex[t][j] = i;
232 // compute face normals
234 for ( t = 0; t < psets[p].numtriangles; t++ )
236 vec3_t side0, side1, facenormal;
238 VectorSubtract( psets[p].triangles[t].verts[0], psets[p].triangles[t].verts[1], side0 );
239 VectorSubtract( psets[p].triangles[t].verts[2], psets[p].triangles[t].verts[1], side1);
241 CrossProduct( side0, side1, facenormal );
242 VectorNormalize( facenormal, faceNormals[t] );
246 // sum normals and copy them back
248 for ( i = 0; i < numUniqueVertices; i++ )
250 for ( t = 0; t < psets[p].numtriangles; t++ )
252 if ( vertexIndex[t][0] == i ||
253 vertexIndex[t][1] == i ||
254 vertexIndex[t][2] == i )
256 normals[i][0] += faceNormals[t][0];
257 normals[i][1] += faceNormals[t][1];
258 normals[i][2] += faceNormals[t][2];
261 VectorNormalize( normals[i], normals[i] );
265 for ( t = 0; t < psets[p].numtriangles; t++ )
267 VectorCopy( normals[vertexIndex[t][0]], psets[p].triangles[t].normals[0] );
268 VectorCopy( normals[vertexIndex[t][1]], psets[p].triangles[t].normals[1] );
269 VectorCopy( normals[vertexIndex[t][2]], psets[p].triangles[t].normals[2] );