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" |
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]; |
101 |
|
} |
102 |
|
|
103 |
|
|
104 |
+ |
void |
105 |
|
freeface(o) /* free memory associated with face */ |
106 |
|
OBJREC *o; |
107 |
|
{ |
112 |
|
} |
113 |
|
|
114 |
|
|
115 |
+ |
int |
116 |
|
inface(p, f) /* determine if point is in face */ |
117 |
|
FVECT p; |
118 |
|
FACE *f; |