quick/netradiant-custom
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

favor blocky triangles over thin triangles a bit

Browse Source
This commit is contained in:
Rudolf Polzer
2010-09-01 07:14:16 +02:00
parent 08dc2f96dc
commit 76e61abc01
1 changed files with 11 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
tools/quake3/q3map2/surface_meta.c
View File

@@ -417,9 +417,9 @@ void TriangulatePatchSurface( entity_t *e , mapDrawSurface_t *ds )
int MaxAreaIndexes(bspDrawVert_t *vert, int cnt, int *indexes)
{
int r, s, t, bestR = 0, bestS = 1, bestT = 2;
int i, j, k;
double A, bestA = -1;
vec3_t ab, ac, cross;
int i, j;
double A, bestA = -1, V, bestV = -1;
vec3_t ab, ac, bc, cross;
bspDrawVert_t *buf;
if(cnt < 3)
@@ -432,11 +432,18 @@ int MaxAreaIndexes(bspDrawVert_t *vert, int cnt, int *indexes)
{
VectorSubtract(vert[s].xyz, vert[r].xyz, ab);
VectorSubtract(vert[t].xyz, vert[r].xyz, ac);
VectorSubtract(vert[t].xyz, vert[s].xyz, bc);
CrossProduct(ab, ac, cross);
A = VectorLength(cross);
if(A > bestA)
V = A - (VectorLength(ab) - VectorLength(ac) - VectorLength(bc)) * 0.2;
/* value = A - circumference * 0.2, i.e. we back out by 0.2 units from each side, to prevent too acute triangles */
/* this kind of simulates "number of 0.2x0.2 fragments in the triangle not touched by an edge" */
if(bestA < 0 || V > bestV)
{
bestA = A;
bestV = V;
bestR = r;
bestS = s;
bestT = t;