| 1 |
– |
/* Copyright (c) 1986 Regents of the University of California */ |
| 2 |
– |
|
| 1 |
|
#ifndef lint |
| 2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
| 2 |
> |
static const char RCSid[] = "$Id$"; |
| 3 |
|
#endif |
| 6 |
– |
|
| 4 |
|
/* |
| 5 |
|
* face.c - routines dealing with polygonal faces. |
| 9 |
– |
* |
| 10 |
– |
* 8/30/85 |
| 6 |
|
*/ |
| 7 |
|
|
| 8 |
+ |
#include "copyright.h" |
| 9 |
+ |
|
| 10 |
|
#include "standard.h" |
| 11 |
|
|
| 12 |
|
#include "object.h" |
| 24 |
|
* The last vertex is automatically connected to the first. |
| 25 |
|
*/ |
| 26 |
|
|
| 27 |
< |
#define VERTEPS 1e-4 /* allowed vertex error */ |
| 27 |
> |
#ifdef SMLFLT |
| 28 |
> |
#define VERTEPS 1e-3 /* allowed vertex error */ |
| 29 |
> |
#else |
| 30 |
> |
#define VERTEPS 1e-5 /* allowed vertex error */ |
| 31 |
> |
#endif |
| 32 |
|
|
| 33 |
|
|
| 34 |
|
FACE * |
| 35 |
< |
getface(o) /* get arguments for a face */ |
| 36 |
< |
OBJREC *o; |
| 35 |
> |
getface( /* get arguments for a face */ |
| 36 |
> |
OBJREC *o |
| 37 |
> |
) |
| 38 |
|
{ |
| 37 |
– |
double fabs(); |
| 39 |
|
double d1; |
| 40 |
< |
int badvert; |
| 40 |
> |
int smalloff, badvert; |
| 41 |
|
FVECT v1, v2, v3; |
| 42 |
< |
register FACE *f; |
| 43 |
< |
register int i; |
| 42 |
> |
FACE *f; |
| 43 |
> |
int i; |
| 44 |
|
|
| 45 |
|
if ((f = (FACE *)o->os) != NULL) |
| 46 |
|
return(f); /* already done */ |
| 56 |
|
|
| 57 |
|
f->va = o->oargs.farg; |
| 58 |
|
f->nv = o->oargs.nfargs / 3; |
| 59 |
+ |
/* check for last==first */ |
| 60 |
+ |
if (f->nv > 3 && dist2(VERTEX(f,0),VERTEX(f,f->nv-1)) <= FTINY*FTINY) |
| 61 |
+ |
f->nv--; |
| 62 |
|
/* compute area and normal */ |
| 63 |
|
f->norm[0] = f->norm[1] = f->norm[2] = 0.0; |
| 64 |
< |
v1[0] = v1[1] = v1[2] = 0.0; |
| 65 |
< |
for (i = 1; i < f->nv; i++) { |
| 64 |
> |
v1[0] = VERTEX(f,1)[0] - VERTEX(f,0)[0]; |
| 65 |
> |
v1[1] = VERTEX(f,1)[1] - VERTEX(f,0)[1]; |
| 66 |
> |
v1[2] = VERTEX(f,1)[2] - VERTEX(f,0)[2]; |
| 67 |
> |
for (i = 2; i < f->nv; i++) { |
| 68 |
|
v2[0] = VERTEX(f,i)[0] - VERTEX(f,0)[0]; |
| 69 |
|
v2[1] = VERTEX(f,i)[1] - VERTEX(f,0)[1]; |
| 70 |
|
v2[2] = VERTEX(f,i)[2] - VERTEX(f,0)[2]; |
| 85 |
|
/* compute offset */ |
| 86 |
|
badvert = 0; |
| 87 |
|
f->offset = DOT(f->norm, VERTEX(f,0)); |
| 88 |
+ |
smalloff = fabs(f->offset) <= VERTEPS; |
| 89 |
|
for (i = 1; i < f->nv; i++) { |
| 90 |
|
d1 = DOT(f->norm, VERTEX(f,i)); |
| 91 |
< |
badvert += fabs(d1 - f->offset/i) > VERTEPS; |
| 91 |
> |
if (smalloff) |
| 92 |
> |
badvert += fabs(d1 - f->offset/i) > VERTEPS; |
| 93 |
> |
else |
| 94 |
> |
badvert += fabs(1.0 - d1*i/f->offset) > VERTEPS; |
| 95 |
|
f->offset += d1; |
| 96 |
|
} |
| 97 |
< |
f->offset /= f->nv; |
| 98 |
< |
if (badvert) |
| 97 |
> |
f->offset /= (double)f->nv; |
| 98 |
> |
if (f->nv > 3 && badvert) |
| 99 |
|
objerror(o, WARNING, "non-planar vertex"); |
| 100 |
|
/* find axis */ |
| 101 |
< |
f->ax = fabs(f->norm[0]) > fabs(f->norm[1]) ? 0 : 1; |
| 101 |
> |
f->ax = (fabs(f->norm[1]) > fabs(f->norm[0])); |
| 102 |
|
if (fabs(f->norm[2]) > fabs(f->norm[f->ax])) |
| 103 |
|
f->ax = 2; |
| 104 |
|
|
| 106 |
|
} |
| 107 |
|
|
| 108 |
|
|
| 109 |
< |
freeface(o) /* free memory associated with face */ |
| 110 |
< |
OBJREC *o; |
| 109 |
> |
void |
| 110 |
> |
freeface( /* free memory associated with face */ |
| 111 |
> |
OBJREC *o |
| 112 |
> |
) |
| 113 |
|
{ |
| 114 |
|
if (o->os == NULL) |
| 115 |
|
return; |
| 118 |
|
} |
| 119 |
|
|
| 120 |
|
|
| 121 |
< |
inface(p, f) /* determine if point is in face */ |
| 122 |
< |
FVECT p; |
| 123 |
< |
FACE *f; |
| 121 |
> |
int |
| 122 |
> |
inface( /* determine if point is in face */ |
| 123 |
> |
FVECT p, |
| 124 |
> |
FACE *f |
| 125 |
> |
) |
| 126 |
|
{ |
| 127 |
|
int ncross, n; |
| 128 |
|
double x, y; |
| 129 |
< |
register int xi, yi; |
| 130 |
< |
register double *p0, *p1; |
| 129 |
> |
int tst; |
| 130 |
> |
int xi, yi; |
| 131 |
> |
RREAL *p0, *p1; |
| 132 |
|
|
| 133 |
< |
xi = (f->ax+1)%3; |
| 134 |
< |
yi = (f->ax+2)%3; |
| 133 |
> |
if ((xi = f->ax + 1) >= 3) xi -= 3; |
| 134 |
> |
if ((yi = xi + 1) >= 3) yi -= 3; |
| 135 |
|
x = p[xi]; |
| 136 |
|
y = p[yi]; |
| 137 |
|
n = f->nv; |
| 140 |
|
ncross = 0; |
| 141 |
|
/* positive x axis cross test */ |
| 142 |
|
while (n--) { |
| 143 |
< |
if ((p0[yi] > y) ^ (p1[yi] > y)) |
| 144 |
< |
if (p0[xi] > x && p1[xi] > x) |
| 143 |
> |
if ((p0[yi] > y) ^ (p1[yi] > y)) { |
| 144 |
> |
tst = (p0[xi] > x) + (p1[xi] > x); |
| 145 |
> |
if (tst == 2) |
| 146 |
|
ncross++; |
| 147 |
< |
else if (p0[xi] > x || p1[xi] > x) |
| 148 |
< |
ncross += (p1[yi] > p0[yi]) ^ |
| 149 |
< |
((p0[yi]-y)*(p1[xi]-x) > |
| 150 |
< |
(p0[xi]-x)*(p1[yi]-y)); |
| 147 |
> |
else if (tst) { |
| 148 |
> |
double prodA = (p0[yi]-y)*(p1[xi]-x); |
| 149 |
> |
double prodB = (p0[xi]-x)*(p1[yi]-y); |
| 150 |
> |
if (FRELEQ(prodA, prodB)) |
| 151 |
> |
return(1); /* edge case #1 */ |
| 152 |
> |
ncross += (p1[yi] > p0[yi]) ^ (prodA > prodB); |
| 153 |
> |
} else if (FRELEQ(p0[xi], x) && FRELEQ(p1[xi], x)) |
| 154 |
> |
return(1); /* edge case #2 */ |
| 155 |
> |
} else if (FRELEQ(p0[yi], y) && FRELEQ(p1[yi], y) && |
| 156 |
> |
(p0[xi] > x) ^ (p1[xi] > x)) |
| 157 |
> |
return(1); /* edge case #3 */ |
| 158 |
|
p0 = p1; |
| 159 |
|
p1 += 3; |
| 160 |
|
} |
