1 |
– |
/* Copyright (c) 1991 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; |
37 |
|
{ |
37 |
– |
double fabs(); |
38 |
|
double d1; |
39 |
< |
int badvert; |
39 |
> |
int smalloff, badvert; |
40 |
|
FVECT v1, v2, v3; |
41 |
|
register FACE *f; |
42 |
|
register int i; |
55 |
|
|
56 |
|
f->va = o->oargs.farg; |
57 |
|
f->nv = o->oargs.nfargs / 3; |
58 |
+ |
/* check for last==first */ |
59 |
+ |
if (dist2(VERTEX(f,0),VERTEX(f,f->nv-1)) <= FTINY*FTINY) |
60 |
+ |
f->nv--; |
61 |
|
/* compute area and normal */ |
62 |
|
f->norm[0] = f->norm[1] = f->norm[2] = 0.0; |
63 |
< |
v1[0] = v1[1] = v1[2] = 0.0; |
64 |
< |
for (i = 1; i < f->nv; i++) { |
63 |
> |
v1[0] = VERTEX(f,1)[0] - VERTEX(f,0)[0]; |
64 |
> |
v1[1] = VERTEX(f,1)[1] - VERTEX(f,0)[1]; |
65 |
> |
v1[2] = VERTEX(f,1)[2] - VERTEX(f,0)[2]; |
66 |
> |
for (i = 2; i < f->nv; i++) { |
67 |
|
v2[0] = VERTEX(f,i)[0] - VERTEX(f,0)[0]; |
68 |
|
v2[1] = VERTEX(f,i)[1] - VERTEX(f,0)[1]; |
69 |
|
v2[2] = VERTEX(f,i)[2] - VERTEX(f,0)[2]; |
84 |
|
/* compute offset */ |
85 |
|
badvert = 0; |
86 |
|
f->offset = DOT(f->norm, VERTEX(f,0)); |
87 |
+ |
smalloff = fabs(f->offset) <= VERTEPS; |
88 |
|
for (i = 1; i < f->nv; i++) { |
89 |
|
d1 = DOT(f->norm, VERTEX(f,i)); |
90 |
< |
badvert += fabs(d1 - f->offset/i) > VERTEPS; |
90 |
> |
if (smalloff) |
91 |
> |
badvert += fabs(d1 - f->offset/i) > VERTEPS; |
92 |
> |
else |
93 |
> |
badvert += fabs(1.0 - d1*i/f->offset) > VERTEPS; |
94 |
|
f->offset += d1; |
95 |
|
} |
96 |
|
f->offset /= (double)f->nv; |
97 |
< |
if (badvert) |
97 |
> |
if (f->nv > 3 && badvert) |
98 |
|
objerror(o, WARNING, "non-planar vertex"); |
99 |
|
/* find axis */ |
100 |
|
f->ax = fabs(f->norm[0]) > fabs(f->norm[1]) ? 0 : 1; |
105 |
|
} |
106 |
|
|
107 |
|
|
108 |
+ |
void |
109 |
|
freeface(o) /* free memory associated with face */ |
110 |
|
OBJREC *o; |
111 |
|
{ |
116 |
|
} |
117 |
|
|
118 |
|
|
119 |
+ |
int |
120 |
|
inface(p, f) /* determine if point is in face */ |
121 |
|
FVECT p; |
122 |
|
FACE *f; |
123 |
|
{ |
124 |
|
int ncross, n; |
125 |
|
double x, y; |
126 |
+ |
int tst; |
127 |
|
register int xi, yi; |
128 |
< |
register FLOAT *p0, *p1; |
128 |
> |
register RREAL *p0, *p1; |
129 |
|
|
130 |
< |
xi = (f->ax+1)%3; |
131 |
< |
yi = (f->ax+2)%3; |
130 |
> |
if ((xi = f->ax + 1) >= 3) xi -= 3; |
131 |
> |
if ((yi = xi + 1) >= 3) yi -= 3; |
132 |
|
x = p[xi]; |
133 |
|
y = p[yi]; |
134 |
|
n = f->nv; |
137 |
|
ncross = 0; |
138 |
|
/* positive x axis cross test */ |
139 |
|
while (n--) { |
140 |
< |
if ((p0[yi] > y) ^ (p1[yi] > y)) |
141 |
< |
if (p0[xi] > x && p1[xi] > x) |
140 |
> |
if ((p0[yi] > y) ^ (p1[yi] > y)) { |
141 |
> |
tst = (p0[xi] > x) + (p1[xi] > x); |
142 |
> |
if (tst == 2) |
143 |
|
ncross++; |
144 |
< |
else if (p0[xi] > x || p1[xi] > x) |
144 |
> |
else if (tst) |
145 |
|
ncross += (p1[yi] > p0[yi]) ^ |
146 |
|
((p0[yi]-y)*(p1[xi]-x) > |
147 |
|
(p0[xi]-x)*(p1[yi]-y)); |
148 |
+ |
} |
149 |
|
p0 = p1; |
150 |
|
p1 += 3; |
151 |
|
} |