Source

qutils / qbsp / tjunc.c

Full commit
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include <ctype.h>
#include <time.h>
#include <stdarg.h>
#include <unistd.h>
include "../common/cmdlib.h"
#include "../common/mathlib.h"
#include "../common/bspfile.h"
#include "bsp5.h"
#include "map.h"


typedef struct wvert_s {
	vec_t t;
	struct wvert_s *prev, *next;
} wvert_t;

typedef struct wedge_s {
	struct wedge_s *next;
	vec3_t dir;
	vec3_t origin;
	wvert_t head;
} wedge_t;

int numwedges, numwverts;
int tjuncs;
int tjuncfaces;

#define	MAXWVERTS	0x20000
#define	MAXWEDGES	0x10000


wvert_t wverts[MAXWVERTS];
wedge_t wedges[MAXWEDGES];


void
PrintFace(face_t * f)
{
	int i;

	for(i = 0; i < f->numpoints; i++)
		printf("(%5.2f, %5.2f, %5.2f)\n", f->pts[i][0], f->pts[i][1],
			   f->pts[i][2]);
}

//============================================================================

#define	NUM_HASH	1024

wedge_t *wedge_hash[NUM_HASH];

static vec3_t hash_min, hash_scale;

static void
InitHash(vec3_t mins, vec3_t maxs)
{
	vec3_t size;
	vec_t volume;
	vec_t scale;
	int newsize[2];

	VectorCopy(mins, hash_min);
	VectorSubtract(maxs, mins, size);
	memset(wedge_hash, 0, sizeof(wedge_hash));

	volume = size[0] * size[1];

	scale = sqrt(volume / NUM_HASH);

	newsize[0] = size[0] / scale;
	newsize[1] = size[1] / scale;

	hash_scale[0] = newsize[0] / size[0];
	hash_scale[1] = newsize[1] / size[1];
	hash_scale[2] = newsize[1];
}

static unsigned
HashVec(vec3_t vec)
{
	unsigned h;

	h = hash_scale[0] * (vec[0] - hash_min[0]) * hash_scale[2]
		+ hash_scale[1] * (vec[1] - hash_min[1]);
	if(h >= NUM_HASH)
		return NUM_HASH - 1;
	return h;
}

//============================================================================

void
CanonicalVector(vec3_t vec)
{
	VectorNormalize(vec);
	if(vec[0] > EQUAL_EPSILON)
		return;
	else if(vec[0] < -EQUAL_EPSILON) {
		VectorSubtract(vec3_origin, vec, vec);
		return;
	} else
		vec[0] = 0;

	if(vec[1] > EQUAL_EPSILON)
		return;
	else if(vec[1] < -EQUAL_EPSILON) {
		VectorSubtract(vec3_origin, vec, vec);
		return;
	} else
		vec[1] = 0;

	if(vec[2] > EQUAL_EPSILON)
		return;
	else if(vec[2] < -EQUAL_EPSILON) {
		VectorSubtract(vec3_origin, vec, vec);
		return;
	} else
		vec[2] = 0;
	Error("CanonicalVector: degenerate");
}

wedge_t *
FindEdge(vec3_t p1, vec3_t p2, vec_t * t1, vec_t * t2)
{
	vec3_t origin;
	vec3_t dir;
	wedge_t *w;
	vec_t temp;
	int h;

	VectorSubtract(p2, p1, dir);
	CanonicalVector(dir);

	*t1 = DotProduct(p1, dir);
	*t2 = DotProduct(p2, dir);

	VectorMA(p1, -*t1, dir, origin);

	if(*t1 > *t2) {
		temp = *t1;
		*t1 = *t2;
		*t2 = temp;
	}

	h = HashVec(origin);

	for(w = wedge_hash[h]; w; w = w->next) {
		temp = w->origin[0] - origin[0];
		if(temp < -EQUAL_EPSILON || temp > EQUAL_EPSILON)
			continue;
		temp = w->origin[1] - origin[1];
		if(temp < -EQUAL_EPSILON || temp > EQUAL_EPSILON)
			continue;
		temp = w->origin[2] - origin[2];
		if(temp < -EQUAL_EPSILON || temp > EQUAL_EPSILON)
			continue;

		temp = w->dir[0] - dir[0];
		if(temp < -EQUAL_EPSILON || temp > EQUAL_EPSILON)
			continue;
		temp = w->dir[1] - dir[1];
		if(temp < -EQUAL_EPSILON || temp > EQUAL_EPSILON)
			continue;
		temp = w->dir[2] - dir[2];
		if(temp < -EQUAL_EPSILON || temp > EQUAL_EPSILON)
			continue;

		return w;
	}

	if(numwedges == MAXWEDGES)
		Error("FindEdge: numwedges == MAXWEDGES");
	w = &wedges[numwedges];
	numwedges++;

	w->next = wedge_hash[h];
	wedge_hash[h] = w;

	VectorCopy(origin, w->origin);
	VectorCopy(dir, w->dir);
	w->head.next = w->head.prev = &w->head;
	w->head.t = 99999;
	return w;
}


/*
===============
AddVert

===============
*/
#define	T_EPSILON	0.01

void
AddVert(wedge_t * w, vec_t t)
{
	wvert_t *v, *newv;

	v = w->head.next;
	do {
		if(fabs(v->t - t) < T_EPSILON)
			return;
		if(v->t > t)
			break;
		v = v->next;
	} while(1);

// insert a new wvert before v
	if(numwverts == MAXWVERTS)
		Error("AddVert: numwverts == MAXWVERTS");

	newv = &wverts[numwverts];
	numwverts++;

	newv->t = t;
	newv->next = v;
	newv->prev = v->prev;
	v->prev->next = newv;
	v->prev = newv;
}


/*
===============
AddEdge

===============
*/
void
AddEdge(vec3_t p1, vec3_t p2)
{
	wedge_t *w;
	vec_t t1, t2;

	w = FindEdge(p1, p2, &t1, &t2);
	AddVert(w, t1);
	AddVert(w, t2);
}

/*
===============
AddFaceEdges

===============
*/
void
AddFaceEdges(face_t * f)
{
	int i, j;

	for(i = 0; i < f->numpoints; i++) {
		j = (i + 1) % f->numpoints;
		AddEdge(f->pts[i], f->pts[j]);
	}
}


//============================================================================

// a specially allocated face that can hold hundreds of edges if needed
byte superfacebuf[8192];
face_t *superface = (face_t *) superfacebuf;

void FixFaceEdges(face_t * f);

face_t *newlist;

void
SplitFaceForTjunc(face_t * f, face_t * original)
{
	int i;
	face_t *new, *chain;
	vec3_t dir, test;
	vec_t v;
	int firstcorner, lastcorner;

	chain = NULL;
	do {
		if(f->numpoints <= MAXPOINTS) {	// the face is now small enough without more cutting
			// so copy it back to the original
			*original = *f;
			original->original = chain;
			original->next = newlist;
			newlist = original;
			return;
		}

		tjuncfaces++;

	  restart:
		// find the last corner 
		VectorSubtract(f->pts[f->numpoints - 1], f->pts[0], dir);
		VectorNormalize(dir);
		for(lastcorner = f->numpoints - 1; lastcorner > 0; lastcorner--) {
			VectorSubtract(f->pts[lastcorner - 1], f->pts[lastcorner], test);
			VectorNormalize(test);
			v = DotProduct(test, dir);
			if(v < 0.9999 || v > 1.00001) {
				break;
			}
		}

		// find the first corner    
		VectorSubtract(f->pts[1], f->pts[0], dir);
		VectorNormalize(dir);
		for(firstcorner = 1; firstcorner < f->numpoints - 1; firstcorner++) {
			VectorSubtract(f->pts[firstcorner + 1], f->pts[firstcorner],
						   test);
			VectorNormalize(test);
			v = DotProduct(test, dir);
			if(v < 0.9999 || v > 1.00001) {
				break;
			}
		}

		if(firstcorner + 2 >= MAXPOINTS) {
			// rotate the point winding
			VectorCopy(f->pts[0], test);
			for(i = 1; i < f->numpoints; i++) {
				VectorCopy(f->pts[i], f->pts[i - 1]);
			}
			VectorCopy(test, f->pts[f->numpoints - 1]);
			goto restart;
		}

		// cut off as big a piece as possible, less than MAXPOINTS, and not
		// past lastcorner

		new = NewFaceFromFace(f);
		if(f->original)
			Error("SplitFaceForTjunc: f->original");

		new->original = chain;
		chain = new;
		new->next = newlist;
		newlist = new;
		if(f->numpoints - firstcorner <= MAXPOINTS)
			new->numpoints = firstcorner + 2;
		else if(lastcorner + 2 < MAXPOINTS &&
				f->numpoints - lastcorner <= MAXPOINTS)
			new->numpoints = lastcorner + 2;
		else
			new->numpoints = MAXPOINTS;

		for(i = 0; i < new->numpoints; i++) {
			VectorCopy(f->pts[i], new->pts[i]);
		}


		for(i = new->numpoints - 1; i < f->numpoints; i++) {
			VectorCopy(f->pts[i], f->pts[i - (new->numpoints - 2)]);
		}
		f->numpoints -= (new->numpoints - 2);
	} while(1);

}


/*
===============
FixFaceEdges

===============
*/
void
FixFaceEdges(face_t * f)
{
	int i, j, k;
	wedge_t *w;
	wvert_t *v;
	vec_t t1, t2;

	*superface = *f;

  restart:
	for(i = 0; i < superface->numpoints; i++) {
		j = (i + 1) % superface->numpoints;

		w = FindEdge(superface->pts[i], superface->pts[j], &t1, &t2);

		for(v = w->head.next; v->t < t1 + T_EPSILON; v = v->next) {
		}

		if(v->t < t2 - T_EPSILON) {
			tjuncs++;
			// insert a new vertex here
			for(k = superface->numpoints; k > j; k--) {
				VectorCopy(superface->pts[k - 1], superface->pts[k]);
			}
			VectorMA(w->origin, v->t, w->dir, superface->pts[j]);
			superface->numpoints++;
			goto restart;
		}
	}


	if(superface->numpoints <= MAXPOINTS) {
		*f = *superface;
		f->next = newlist;
		newlist = f;
		return;
	}
// the face needs to be split into multiple faces because of too many edges

	SplitFaceForTjunc(superface, f);

}


//============================================================================

void
tjunc_find_r(node_t * node)
{
	face_t *f;

	if(node->planenum == PLANENUM_LEAF)
		return;

	for(f = node->faces; f; f = f->next)
		AddFaceEdges(f);

	tjunc_find_r(node->children[0]);
	tjunc_find_r(node->children[1]);
}

void
tjunc_fix_r(node_t * node)
{
	face_t *f, *next;

	if(node->planenum == PLANENUM_LEAF)
		return;

	newlist = NULL;

	for(f = node->faces; f; f = next) {
		next = f->next;
		FixFaceEdges(f);
	}

	node->faces = newlist;

	tjunc_fix_r(node->children[0]);
	tjunc_fix_r(node->children[1]);
}

/*
===========
tjunc

===========
*/
void
tjunc(node_t * headnode)
{
	vec3_t maxs, mins;
	int i;

	qprintf("---- tjunc ----\n");

	if(notjunc)
		return;

//
// identify all points on common edges
//

// origin points won't allways be inside the map, so extend the hash area 
	for(i = 0; i < 3; i++) {
		if(fabs(brushset->maxs[i]) > fabs(brushset->mins[i]))
			maxs[i] = fabs(brushset->maxs[i]);
		else
			maxs[i] = fabs(brushset->mins[i]);
	}
	VectorSubtract(vec3_origin, maxs, mins);

	InitHash(mins, maxs);

	numwedges = numwverts = 0;

	tjunc_find_r(headnode);

	qprintf("%i world edges  %i edge points\n", numwedges, numwverts);

//
// add extra vertexes on edges where needed
//
	tjuncs = tjuncfaces = 0;

	tjunc_fix_r(headnode);

	qprintf("%i edges added by tjunctions\n", tjuncs);
	qprintf("%i faces added by tjunctions\n", tjuncfaces);
}