19 |
|
|
20 |
|
#include "random.h" |
21 |
|
|
22 |
+ |
#define MINSAMPLES 5 /* minimum number of pretest samples */ |
23 |
+ |
#define STESTMAX 30 /* maximum seeks per sample */ |
24 |
|
|
25 |
+ |
|
26 |
|
double getdisk(); |
27 |
|
|
28 |
|
static OBJECT *vobject; /* virtual source objects */ |
104 |
|
for (i = 0; i < vsmat->nproj; i++) |
105 |
|
if ((*vsmat->vproj)(proj, o, &source[sn], i)) |
106 |
|
if ((ns = makevsrc(o, sn, proj)) >= 0) { |
107 |
+ |
source[ns].sa.sv.pn = i; |
108 |
|
#ifdef DEBUG |
109 |
|
virtverb(ns, stderr); |
110 |
|
#endif |
135 |
|
if (source[sn].sflags & SPROX) |
136 |
|
return(-1); /* should never get here! */ |
137 |
|
multv3(nsloc, source[sn].sloc, pm); |
138 |
+ |
normalize(nsloc); |
139 |
|
VCOPY(ourspot.aim, ocent); |
140 |
|
ourspot.siz = PI*maxrad2; |
141 |
|
ourspot.flen = 0.; |
142 |
|
if (source[sn].sflags & SSPOT) { |
138 |
– |
copystruct(&theirspot, source[sn].sl.s); |
143 |
|
multp3(theirspot.aim, source[sn].sl.s->aim, pm); |
144 |
+ |
d = sqrt(dist2(ourspot.aim, theirspot.aim)); |
145 |
+ |
d = sqrt(source[sn].sl.s->siz/PI) + d*source[sn].ss; |
146 |
+ |
theirspot.siz = PI*d*d; |
147 |
+ |
ourspot.flen = theirspot.flen = source[sn].sl.s->flen; |
148 |
|
d = ourspot.siz; |
149 |
|
if (!commonbeam(&ourspot, &theirspot, nsloc)) |
150 |
|
return(-1); /* no overlap */ |
166 |
|
return(-1); /* at source!! */ |
167 |
|
if (source[sn].sflags & SPROX && d > source[sn].sl.prox) |
168 |
|
return(-1); /* too far away */ |
161 |
– |
ourspot.siz = 2.*PI*(1. - d/sqrt(d*d+maxrad2)); |
169 |
|
ourspot.flen = 0.; |
170 |
+ |
d = (sqrt(maxrad2) + source[sn].ss) / d; |
171 |
+ |
if (d < 1.-FTINY) |
172 |
+ |
ourspot.siz = 2.*PI*(1. - sqrt(1.-d*d)); |
173 |
+ |
else |
174 |
+ |
nsflags &= ~SSPOT; |
175 |
|
if (source[sn].sflags & SSPOT) { |
176 |
|
copystruct(&theirspot, source[sn].sl.s); |
177 |
|
multv3(theirspot.aim, source[sn].sl.s->aim, pm); |
178 |
< |
d = ourspot.siz; |
179 |
< |
if (!commonspot(&ourspot, &theirspot, nsloc)) |
180 |
< |
return(-1); /* no overlap */ |
178 |
> |
normalize(theirspot.aim); |
179 |
> |
if (nsflags & SSPOT) { |
180 |
> |
ourspot.flen = theirspot.flen; |
181 |
> |
d = ourspot.siz; |
182 |
> |
if (!commonspot(&ourspot, &theirspot, nsloc)) |
183 |
> |
return(-1); /* no overlap */ |
184 |
> |
} else { |
185 |
> |
nsflags |= SSPOT; |
186 |
> |
copystruct(&ourspot, &theirspot); |
187 |
> |
d = 2.*ourspot.siz; |
188 |
> |
} |
189 |
|
if (ourspot.siz < d-FTINY) { /* it shrunk */ |
190 |
|
d = spotdisk(v, op, &ourspot, nsloc); |
191 |
|
if (d <= FTINY) |
195 |
|
VCOPY(ocent, v); |
196 |
|
} |
197 |
|
} |
178 |
– |
ourspot.flen = theirspot.flen; |
198 |
|
} |
199 |
|
if (source[sn].sflags & SFLAT) { /* behind source? */ |
200 |
|
multv3(nsnorm, source[sn].snorm, pm); |
201 |
+ |
normalize(nsnorm); |
202 |
|
if (!checkspot(&ourspot, nsnorm)) |
203 |
|
return(-1); |
204 |
|
} |
215 |
|
if (nsflags & SFLAT) |
216 |
|
VCOPY(source[i].snorm, nsnorm); |
217 |
|
source[i].ss = source[sn].ss; source[i].ss2 = source[sn].ss2; |
218 |
< |
if ((source[i].sl.s = (SPOT *)malloc(sizeof(SPOT))) == NULL) |
219 |
< |
goto memerr; |
220 |
< |
copystruct(source[i].sl.s, &ourspot); |
218 |
> |
if (nsflags & SSPOT) { |
219 |
> |
if ((source[i].sl.s = (SPOT *)malloc(sizeof(SPOT))) == NULL) |
220 |
> |
goto memerr; |
221 |
> |
copystruct(source[i].sl.s, &ourspot); |
222 |
> |
} |
223 |
|
if (nsflags & SPROX) |
224 |
|
source[i].sl.prox = source[sn].sl.prox; |
225 |
< |
source[i].sa.svnext = sn; |
225 |
> |
source[i].sa.sv.sn = sn; |
226 |
|
source[i].so = op; |
227 |
|
return(i); |
228 |
|
memerr: |
275 |
|
FVECT offsdir; |
276 |
|
double or, d; |
277 |
|
int infront; |
278 |
< |
int ssn; |
278 |
> |
int stestlim, ssn; |
279 |
|
int nhit, nok; |
280 |
|
register int i, n; |
281 |
|
/* return if pretesting disabled */ |
294 |
|
n = or2/DOT(offsdir,offsdir)*vspretest + .5; |
295 |
|
infront = DOT(onorm, offsdir) > 0.; |
296 |
|
} |
297 |
< |
if (n < 1) n = 1; |
297 |
> |
if (n < MINSAMPLES) n = MINSAMPLES; |
298 |
|
#ifdef DEBUG |
299 |
|
fprintf(stderr, "pretesting source %d in object %s with %d rays\n", |
300 |
|
sn, o->oname, n); |
301 |
|
#endif |
302 |
|
/* sample */ |
303 |
|
or = sqrt(or2); |
304 |
< |
ssn = 25*n; |
304 |
> |
stestlim = n*STESTMAX; |
305 |
> |
ssn = 0; |
306 |
|
nhit = nok = 0; |
307 |
|
while (n-- > 0) { |
308 |
|
/* get sample point */ |
309 |
|
do { |
310 |
< |
if (--ssn < 0) { |
310 |
> |
if (ssn >= stestlim) { |
311 |
|
#ifdef DEBUG |
312 |
|
fprintf(stderr, "\ttoo hard to hit\n"); |
313 |
|
#endif |
315 |
|
} |
316 |
|
for (i = 0; i < 3; i++) |
317 |
|
offsdir[i] = or*(1. - |
318 |
< |
2.*urand(931*i+5827+ssn)); |
318 |
> |
2.*urand(urind(931*i+5827,ssn))); |
319 |
> |
ssn++; |
320 |
|
for (i = 0; i < 3; i++) |
321 |
|
sr.rorg[i] = oc[i] + offsdir[i]; |
322 |
|
d = DOT(offsdir,onorm); |
342 |
|
continue; |
343 |
|
nok++; |
344 |
|
/* check against obstructions */ |
345 |
< |
srcray(&sr, NULL, sn); |
345 |
> |
rayclear(&sr); |
346 |
> |
sr.revf = raytrace; |
347 |
|
rayvalue(&sr); |
348 |
|
if (bright(sr.rcol) > FTINY) |
349 |
|
nhit++; |
381 |
|
fprintf(fp, "\tat (%f,%f,%f)\n", |
382 |
|
source[sn].sloc[0], source[sn].sloc[1], source[sn].sloc[2]); |
383 |
|
fprintf(fp, "\tlinked to source %d (%s)\n", |
384 |
< |
source[sn].sa.svnext, source[source[sn].sa.svnext].so->oname); |
384 |
> |
source[sn].sa.sv.sn, source[source[sn].sa.sv.sn].so->oname); |
385 |
|
if (source[sn].sflags & SFOLLOW) |
386 |
|
fprintf(fp, "\talways followed\n"); |
387 |
|
else |