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 |
|
* Routines to do the actual calculation for mkillum |
6 |
|
*/ |
7 |
|
|
8 |
|
#include "mkillum.h" |
12 |
– |
|
9 |
|
#include "face.h" |
14 |
– |
|
10 |
|
#include "cone.h" |
16 |
– |
|
11 |
|
#include "random.h" |
12 |
|
|
13 |
|
|
60 |
|
distarr = (float *)calloc(n, 3*sizeof(float)); |
61 |
|
if (distarr == NULL) |
62 |
|
error(SYSTEM, "out of memory in o_face"); |
63 |
< |
mkaxes(u, v, fa->norm); |
63 |
> |
/* take first edge longer than sqrt(area) */ |
64 |
> |
for (j = fa->nv-1, i = 0; i < fa->nv; j = i++) { |
65 |
> |
u[0] = VERTEX(fa,i)[0] - VERTEX(fa,j)[0]; |
66 |
> |
u[1] = VERTEX(fa,i)[1] - VERTEX(fa,j)[1]; |
67 |
> |
u[2] = VERTEX(fa,i)[2] - VERTEX(fa,j)[2]; |
68 |
> |
if ((r1 = DOT(u,u)) >= fa->area-FTINY) |
69 |
> |
break; |
70 |
> |
} |
71 |
> |
if (i < fa->nv) { /* got one! -- let's align our axes */ |
72 |
> |
r2 = 1.0/sqrt(r1); |
73 |
> |
u[0] *= r2; u[1] *= r2; u[2] *= r2; |
74 |
> |
fcross(v, fa->norm, u); |
75 |
> |
} else /* oh well, we'll just have to wing it */ |
76 |
> |
mkaxes(u, v, fa->norm); |
77 |
> |
/* now, find limits in (u,v) coordinates */ |
78 |
|
ur[0] = vr[0] = FHUGE; |
79 |
|
ur[1] = vr[1] = -FHUGE; |
80 |
|
for (i = 0; i < fa->nv; i++) { |
112 |
|
objerror(ob, WARNING, "bad aspect"); |
113 |
|
rt->nrays = 0; |
114 |
|
freeface(ob); |
115 |
< |
free((char *)distarr); |
115 |
> |
free((void *)distarr); |
116 |
|
o_default(ob, il, rt, nm); |
117 |
|
return; |
118 |
|
} |
131 |
|
printobj(il->altmat, ob); |
132 |
|
/* clean up */ |
133 |
|
freeface(ob); |
134 |
< |
free((char *)distarr); |
134 |
> |
free((void *)distarr); |
135 |
|
#undef MAXMISS |
136 |
|
} |
137 |
|
|
157 |
|
nalt = nazi = 1; |
158 |
|
else { |
159 |
|
n = 4.*PI * il->sampdens; |
160 |
< |
nalt = sqrt(n/PI) + .5; |
161 |
< |
nazi = PI*nalt + .5; |
160 |
> |
nalt = sqrt(2./PI*n) + .5; |
161 |
> |
nazi = PI/2.*nalt + .5; |
162 |
|
} |
163 |
|
n = nalt*nazi; |
164 |
|
distarr = (float *)calloc(n, 3*sizeof(float)); |
201 |
|
} else |
202 |
|
printobj(il->altmat, ob); |
203 |
|
/* clean up */ |
204 |
< |
free((char *)distarr); |
204 |
> |
free((void *)distarr); |
205 |
|
} |
206 |
|
|
207 |
|
|
254 |
|
r1 = r3*cos(r2); |
255 |
|
r2 = r3*sin(r2); |
256 |
|
for (j = 0; j < 3; j++) |
257 |
< |
org[j] = CO_P0(co)[j] + r1*u[j] + r1*v[j] + |
257 |
> |
org[j] = CO_P0(co)[j] + r1*u[j] + r2*v[j] + |
258 |
|
.001*co->ad[j]; |
259 |
|
|
260 |
|
/* send sample */ |
270 |
|
printobj(il->altmat, ob); |
271 |
|
/* clean up */ |
272 |
|
freecone(ob); |
273 |
< |
free((char *)distarr); |
273 |
> |
free((void *)distarr); |
274 |
|
} |
275 |
|
|
276 |
|
|
299 |
|
return; |
300 |
|
bzero(rt->buf+6*rt->nrays, 6*sizeof(float)); |
301 |
|
errno = 0; |
302 |
< |
if ( process(rt->pd, (char *)rt->buf, (char *)rt->buf, |
303 |
< |
3*sizeof(float)*rt->nrays, |
302 |
> |
if ( process(&(rt->pd), (char *)rt->buf, (char *)rt->buf, |
303 |
> |
3*sizeof(float)*(rt->nrays+1), |
304 |
|
6*sizeof(float)*(rt->nrays+1)) < |
305 |
< |
3*sizeof(float)*rt->nrays ) |
305 |
> |
3*sizeof(float)*(rt->nrays+1) ) |
306 |
|
error(SYSTEM, "error reading from rtrace process"); |
307 |
|
i = rt->nrays; |
308 |
|
while (i--) { |