1 |
/* Copyright (c) 1994 Regents of the University of California */ |
2 |
|
3 |
#ifndef lint |
4 |
static char SCCSid[] = "$SunId$ LBL"; |
5 |
#endif |
6 |
|
7 |
/* |
8 |
* raytrace.c - routines for tracing and shading rays. |
9 |
* |
10 |
* 8/7/85 |
11 |
*/ |
12 |
|
13 |
#include "ray.h" |
14 |
|
15 |
#include "octree.h" |
16 |
|
17 |
#include "otypes.h" |
18 |
|
19 |
#include "otspecial.h" |
20 |
|
21 |
#define MAXCSET ((MAXSET+1)*2-1) /* maximum check set size */ |
22 |
|
23 |
extern CUBE thescene; /* our scene */ |
24 |
extern int maxdepth; /* maximum recursion depth */ |
25 |
extern double minweight; /* minimum ray weight */ |
26 |
extern int do_irrad; /* compute irradiance? */ |
27 |
|
28 |
unsigned long raynum = 0; /* next unique ray number */ |
29 |
unsigned long nrays = 0; /* number of calls to localhit */ |
30 |
|
31 |
static FLOAT Lambfa[5] = {PI, PI, PI, 0.0, 0.0}; |
32 |
OBJREC Lamb = { |
33 |
OVOID, MAT_PLASTIC, "Lambertian", |
34 |
{0, 5, NULL, Lambfa}, NULL, |
35 |
}; /* a Lambertian surface */ |
36 |
|
37 |
static int raymove(), checkset(), checkhit(); |
38 |
|
39 |
#define MAXLOOP 128 /* modifier loop detection */ |
40 |
|
41 |
#define RAYHIT (-1) /* return value for intercepted ray */ |
42 |
|
43 |
|
44 |
rayorigin(r, ro, rt, rw) /* start new ray from old one */ |
45 |
register RAY *r, *ro; |
46 |
int rt; |
47 |
double rw; |
48 |
{ |
49 |
if ((r->parent = ro) == NULL) { /* primary ray */ |
50 |
r->rlvl = 0; |
51 |
r->rweight = rw; |
52 |
r->crtype = r->rtype = rt; |
53 |
r->rsrc = -1; |
54 |
r->clipset = NULL; |
55 |
r->revf = raytrace; |
56 |
} else { /* spawned ray */ |
57 |
r->rlvl = ro->rlvl; |
58 |
if (rt & RAYREFL) { |
59 |
r->rlvl++; |
60 |
r->rsrc = -1; |
61 |
r->clipset = ro->clipset; |
62 |
} else { |
63 |
r->rsrc = ro->rsrc; |
64 |
r->clipset = ro->newcset; |
65 |
} |
66 |
r->revf = ro->revf; |
67 |
r->rweight = ro->rweight * rw; |
68 |
r->crtype = ro->crtype | (r->rtype = rt); |
69 |
VCOPY(r->rorg, ro->rop); |
70 |
} |
71 |
rayclear(r); |
72 |
return(r->rlvl <= maxdepth && r->rweight >= minweight ? 0 : -1); |
73 |
} |
74 |
|
75 |
|
76 |
rayclear(r) /* clear a ray for (re)evaluation */ |
77 |
register RAY *r; |
78 |
{ |
79 |
r->rno = raynum++; |
80 |
r->newcset = r->clipset; |
81 |
r->ro = NULL; |
82 |
r->rot = FHUGE; |
83 |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
84 |
setcolor(r->pcol, 1.0, 1.0, 1.0); |
85 |
setcolor(r->rcol, 0.0, 0.0, 0.0); |
86 |
r->rt = 0.0; |
87 |
} |
88 |
|
89 |
|
90 |
raytrace(r) /* trace a ray and compute its value */ |
91 |
RAY *r; |
92 |
{ |
93 |
extern int (*trace)(); |
94 |
int gotmat; |
95 |
|
96 |
if (localhit(r, &thescene)) |
97 |
gotmat = raycont(r); |
98 |
else if (sourcehit(r)) |
99 |
gotmat = rayshade(r, r->ro->omod); |
100 |
|
101 |
if (!gotmat) |
102 |
objerror(r->ro, USER, "material not found"); |
103 |
|
104 |
if (trace != NULL) |
105 |
(*trace)(r); /* trace execution */ |
106 |
} |
107 |
|
108 |
|
109 |
raycont(r) /* check for clipped object and continue */ |
110 |
register RAY *r; |
111 |
{ |
112 |
if ((r->clipset != NULL && inset(r->clipset, r->ro->omod)) || |
113 |
r->ro->omod == OVOID) { |
114 |
raytrans(r); |
115 |
return(1); |
116 |
} |
117 |
return(rayshade(r, r->ro->omod)); |
118 |
} |
119 |
|
120 |
|
121 |
raytrans(r) /* transmit ray as is */ |
122 |
register RAY *r; |
123 |
{ |
124 |
RAY tr; |
125 |
|
126 |
if (rayorigin(&tr, r, TRANS, 1.0) == 0) { |
127 |
VCOPY(tr.rdir, r->rdir); |
128 |
rayvalue(&tr); |
129 |
copycolor(r->rcol, tr.rcol); |
130 |
r->rt = r->rot + tr.rt; |
131 |
} |
132 |
} |
133 |
|
134 |
|
135 |
rayshade(r, mod) /* shade ray r with material mod */ |
136 |
register RAY *r; |
137 |
int mod; |
138 |
{ |
139 |
static int depth = 0; |
140 |
int gotmat; |
141 |
register OBJREC *m; |
142 |
/* check for infinite loop */ |
143 |
if (depth++ >= MAXLOOP) |
144 |
objerror(r->ro, USER, "possible modifier loop"); |
145 |
r->rt = r->rot; /* set effective ray length */ |
146 |
for (gotmat = 0; !gotmat && mod != OVOID; mod = m->omod) { |
147 |
m = objptr(mod); |
148 |
/****** unnecessary test since modifier() is always called |
149 |
if (!ismodifier(m->otype)) { |
150 |
sprintf(errmsg, "illegal modifier \"%s\"", m->oname); |
151 |
error(USER, errmsg); |
152 |
} |
153 |
******/ |
154 |
/* hack for irradiance calculation */ |
155 |
if (do_irrad && !(r->crtype & ~(PRIMARY|TRANS))) { |
156 |
if (irr_ignore(m->otype)) { |
157 |
depth--; |
158 |
raytrans(r); |
159 |
return; |
160 |
} |
161 |
if (!islight(m->otype)) |
162 |
m = &Lamb; |
163 |
} |
164 |
/* materials call raytexture */ |
165 |
gotmat = (*ofun[m->otype].funp)(m, r); |
166 |
} |
167 |
depth--; |
168 |
return(gotmat); |
169 |
} |
170 |
|
171 |
|
172 |
raytexture(r, mod) /* get material modifiers */ |
173 |
RAY *r; |
174 |
int mod; |
175 |
{ |
176 |
static int depth = 0; |
177 |
register OBJREC *m; |
178 |
/* check for infinite loop */ |
179 |
if (depth++ >= MAXLOOP) |
180 |
objerror(r->ro, USER, "modifier loop"); |
181 |
/* execute textures and patterns */ |
182 |
for ( ; mod != OVOID; mod = m->omod) { |
183 |
m = objptr(mod); |
184 |
/****** unnecessary test since modifier() is always called |
185 |
if (!ismodifier(m->otype)) { |
186 |
sprintf(errmsg, "illegal modifier \"%s\"", m->oname); |
187 |
error(USER, errmsg); |
188 |
} |
189 |
******/ |
190 |
if ((*ofun[m->otype].funp)(m, r)) |
191 |
objerror(r->ro, USER, "conflicting materials"); |
192 |
} |
193 |
depth--; /* end here */ |
194 |
} |
195 |
|
196 |
|
197 |
raymixture(r, fore, back, coef) /* mix modifiers */ |
198 |
register RAY *r; |
199 |
OBJECT fore, back; |
200 |
double coef; |
201 |
{ |
202 |
RAY fr, br; |
203 |
int foremat, backmat; |
204 |
register int i; |
205 |
/* clip coefficient */ |
206 |
if (coef > 1.0) |
207 |
coef = 1.0; |
208 |
else if (coef < 0.0) |
209 |
coef = 0.0; |
210 |
/* foreground */ |
211 |
copystruct(&fr, r); |
212 |
if (fore != OVOID && coef > FTINY) |
213 |
foremat = rayshade(&fr, fore); |
214 |
else |
215 |
foremat = 0; |
216 |
/* background */ |
217 |
copystruct(&br, r); |
218 |
if (back != OVOID && coef < 1.0-FTINY) |
219 |
backmat = rayshade(&br, back); |
220 |
else |
221 |
backmat = foremat; |
222 |
/* check */ |
223 |
if ((foremat==0) != (backmat==0)) |
224 |
objerror(r->ro, USER, "mixing material with non-material"); |
225 |
/* mix perturbations */ |
226 |
for (i = 0; i < 3; i++) |
227 |
r->pert[i] = coef*fr.pert[i] + (1.0-coef)*br.pert[i]; |
228 |
/* mix pattern colors */ |
229 |
scalecolor(fr.pcol, coef); |
230 |
scalecolor(br.pcol, 1.0-coef); |
231 |
copycolor(r->pcol, fr.pcol); |
232 |
addcolor(r->pcol, br.pcol); |
233 |
/* mix returned ray values */ |
234 |
if (foremat) { |
235 |
scalecolor(fr.rcol, coef); |
236 |
scalecolor(br.rcol, 1.0-coef); |
237 |
copycolor(r->rcol, fr.rcol); |
238 |
addcolor(r->rcol, br.rcol); |
239 |
r->rt = bright(fr.rcol) > bright(br.rcol) ? fr.rt : br.rt; |
240 |
} |
241 |
/* return value tells if material */ |
242 |
return(foremat); |
243 |
} |
244 |
|
245 |
|
246 |
double |
247 |
raynormal(norm, r) /* compute perturbed normal for ray */ |
248 |
FVECT norm; |
249 |
register RAY *r; |
250 |
{ |
251 |
double newdot; |
252 |
register int i; |
253 |
|
254 |
/* The perturbation is added to the surface normal to obtain |
255 |
* the new normal. If the new normal would affect the surface |
256 |
* orientation wrt. the ray, a correction is made. The method is |
257 |
* still fraught with problems since reflected rays and similar |
258 |
* directions calculated from the surface normal may spawn rays behind |
259 |
* the surface. The only solution is to curb textures at high |
260 |
* incidence (namely, keep DOT(rdir,pert) < Rdot). |
261 |
*/ |
262 |
|
263 |
for (i = 0; i < 3; i++) |
264 |
norm[i] = r->ron[i] + r->pert[i]; |
265 |
|
266 |
if (normalize(norm) == 0.0) { |
267 |
objerror(r->ro, WARNING, "illegal normal perturbation"); |
268 |
VCOPY(norm, r->ron); |
269 |
return(r->rod); |
270 |
} |
271 |
newdot = -DOT(norm, r->rdir); |
272 |
if ((newdot > 0.0) != (r->rod > 0.0)) { /* fix orientation */ |
273 |
for (i = 0; i < 3; i++) |
274 |
norm[i] += 2.0*newdot*r->rdir[i]; |
275 |
newdot = -newdot; |
276 |
} |
277 |
return(newdot); |
278 |
} |
279 |
|
280 |
|
281 |
newrayxf(r) /* get new tranformation matrix for ray */ |
282 |
RAY *r; |
283 |
{ |
284 |
static struct xfn { |
285 |
struct xfn *next; |
286 |
FULLXF xf; |
287 |
} xfseed = { &xfseed }, *xflast = &xfseed; |
288 |
register struct xfn *xp; |
289 |
register RAY *rp; |
290 |
|
291 |
/* |
292 |
* Search for transform in circular list that |
293 |
* has no associated ray in the tree. |
294 |
*/ |
295 |
xp = xflast; |
296 |
for (rp = r->parent; rp != NULL; rp = rp->parent) |
297 |
if (rp->rox == &xp->xf) { /* xp in use */ |
298 |
xp = xp->next; /* move to next */ |
299 |
if (xp == xflast) { /* need new one */ |
300 |
xp = (struct xfn *)bmalloc(sizeof(struct xfn)); |
301 |
if (xp == NULL) |
302 |
error(SYSTEM, |
303 |
"out of memory in newrayxf"); |
304 |
/* insert in list */ |
305 |
xp->next = xflast->next; |
306 |
xflast->next = xp; |
307 |
break; /* we're done */ |
308 |
} |
309 |
rp = r; /* start check over */ |
310 |
} |
311 |
/* got it */ |
312 |
r->rox = &xp->xf; |
313 |
xflast = xp; |
314 |
} |
315 |
|
316 |
|
317 |
flipsurface(r) /* reverse surface orientation */ |
318 |
register RAY *r; |
319 |
{ |
320 |
r->rod = -r->rod; |
321 |
r->ron[0] = -r->ron[0]; |
322 |
r->ron[1] = -r->ron[1]; |
323 |
r->ron[2] = -r->ron[2]; |
324 |
r->pert[0] = -r->pert[0]; |
325 |
r->pert[1] = -r->pert[1]; |
326 |
r->pert[2] = -r->pert[2]; |
327 |
} |
328 |
|
329 |
|
330 |
localhit(r, scene) /* check for hit in the octree */ |
331 |
register RAY *r; |
332 |
register CUBE *scene; |
333 |
{ |
334 |
OBJECT cxset[MAXCSET+1]; /* set of checked objects */ |
335 |
FVECT curpos; /* current cube position */ |
336 |
int sflags; /* sign flags */ |
337 |
double t, dt; |
338 |
register int i; |
339 |
|
340 |
nrays++; /* increment trace counter */ |
341 |
sflags = 0; |
342 |
for (i = 0; i < 3; i++) { |
343 |
curpos[i] = r->rorg[i]; |
344 |
if (r->rdir[i] > 1e-7) |
345 |
sflags |= 1 << i; |
346 |
else if (r->rdir[i] < -1e-7) |
347 |
sflags |= 0x10 << i; |
348 |
} |
349 |
if (sflags == 0) |
350 |
error(CONSISTENCY, "zero ray direction in localhit"); |
351 |
t = 0.0; |
352 |
if (!incube(scene, curpos)) { |
353 |
/* find distance to entry */ |
354 |
for (i = 0; i < 3; i++) { |
355 |
/* plane in our direction */ |
356 |
if (sflags & 1<<i) |
357 |
dt = scene->cuorg[i]; |
358 |
else if (sflags & 0x10<<i) |
359 |
dt = scene->cuorg[i] + scene->cusize; |
360 |
else |
361 |
continue; |
362 |
/* distance to the plane */ |
363 |
dt = (dt - r->rorg[i])/r->rdir[i]; |
364 |
if (dt > t) |
365 |
t = dt; /* farthest face is the one */ |
366 |
} |
367 |
t += FTINY; /* fudge to get inside cube */ |
368 |
/* advance position */ |
369 |
for (i = 0; i < 3; i++) |
370 |
curpos[i] += r->rdir[i]*t; |
371 |
|
372 |
if (!incube(scene, curpos)) /* non-intersecting ray */ |
373 |
return(0); |
374 |
} |
375 |
cxset[0] = 0; |
376 |
return(raymove(curpos, cxset, sflags, r, scene) == RAYHIT); |
377 |
} |
378 |
|
379 |
|
380 |
static int |
381 |
raymove(pos, cxs, dirf, r, cu) /* check for hit as we move */ |
382 |
FVECT pos; /* current position, modified herein */ |
383 |
OBJECT *cxs; /* checked objects, modified by checkhit */ |
384 |
int dirf; /* direction indicators to speed tests */ |
385 |
register RAY *r; |
386 |
register CUBE *cu; |
387 |
{ |
388 |
int ax; |
389 |
double dt, t; |
390 |
|
391 |
if (istree(cu->cutree)) { /* recurse on subcubes */ |
392 |
CUBE cukid; |
393 |
register int br, sgn; |
394 |
|
395 |
cukid.cusize = cu->cusize * 0.5; /* find subcube */ |
396 |
VCOPY(cukid.cuorg, cu->cuorg); |
397 |
br = 0; |
398 |
if (pos[0] >= cukid.cuorg[0]+cukid.cusize) { |
399 |
cukid.cuorg[0] += cukid.cusize; |
400 |
br |= 1; |
401 |
} |
402 |
if (pos[1] >= cukid.cuorg[1]+cukid.cusize) { |
403 |
cukid.cuorg[1] += cukid.cusize; |
404 |
br |= 2; |
405 |
} |
406 |
if (pos[2] >= cukid.cuorg[2]+cukid.cusize) { |
407 |
cukid.cuorg[2] += cukid.cusize; |
408 |
br |= 4; |
409 |
} |
410 |
for ( ; ; ) { |
411 |
cukid.cutree = octkid(cu->cutree, br); |
412 |
if ((ax = raymove(pos,cxs,dirf,r,&cukid)) == RAYHIT) |
413 |
return(RAYHIT); |
414 |
sgn = 1 << ax; |
415 |
if (sgn & dirf) /* positive axis? */ |
416 |
if (sgn & br) |
417 |
return(ax); /* overflow */ |
418 |
else { |
419 |
cukid.cuorg[ax] += cukid.cusize; |
420 |
br |= sgn; |
421 |
} |
422 |
else |
423 |
if (sgn & br) { |
424 |
cukid.cuorg[ax] -= cukid.cusize; |
425 |
br &= ~sgn; |
426 |
} else |
427 |
return(ax); /* underflow */ |
428 |
} |
429 |
/*NOTREACHED*/ |
430 |
} |
431 |
if (isfull(cu->cutree) && checkhit(r, cu, cxs)) |
432 |
return(RAYHIT); |
433 |
/* advance to next cube */ |
434 |
if (dirf&0x11) { |
435 |
dt = dirf&1 ? cu->cuorg[0] + cu->cusize : cu->cuorg[0]; |
436 |
t = (dt - pos[0])/r->rdir[0]; |
437 |
ax = 0; |
438 |
} else |
439 |
t = FHUGE; |
440 |
if (dirf&0x22) { |
441 |
dt = dirf&2 ? cu->cuorg[1] + cu->cusize : cu->cuorg[1]; |
442 |
dt = (dt - pos[1])/r->rdir[1]; |
443 |
if (dt < t) { |
444 |
t = dt; |
445 |
ax = 1; |
446 |
} |
447 |
} |
448 |
if (dirf&0x44) { |
449 |
dt = dirf&4 ? cu->cuorg[2] + cu->cusize : cu->cuorg[2]; |
450 |
dt = (dt - pos[2])/r->rdir[2]; |
451 |
if (dt < t) { |
452 |
t = dt; |
453 |
ax = 2; |
454 |
} |
455 |
} |
456 |
pos[0] += r->rdir[0]*t; |
457 |
pos[1] += r->rdir[1]*t; |
458 |
pos[2] += r->rdir[2]*t; |
459 |
return(ax); |
460 |
} |
461 |
|
462 |
|
463 |
static |
464 |
checkhit(r, cu, cxs) /* check for hit in full cube */ |
465 |
register RAY *r; |
466 |
CUBE *cu; |
467 |
OBJECT *cxs; |
468 |
{ |
469 |
OBJECT oset[MAXSET+1]; |
470 |
register OBJREC *o; |
471 |
register int i; |
472 |
|
473 |
objset(oset, cu->cutree); |
474 |
checkset(oset, cxs); /* eliminate double-checking */ |
475 |
for (i = oset[0]; i > 0; i--) { |
476 |
o = objptr(oset[i]); |
477 |
(*ofun[o->otype].funp)(o, r); |
478 |
} |
479 |
if (r->ro == NULL) |
480 |
return(0); /* no scores yet */ |
481 |
|
482 |
return(incube(cu, r->rop)); /* hit OK if in current cube */ |
483 |
} |
484 |
|
485 |
|
486 |
static |
487 |
checkset(os, cs) /* modify checked set and set to check */ |
488 |
register OBJECT *os; /* os' = os - cs */ |
489 |
register OBJECT *cs; /* cs' = cs + os */ |
490 |
{ |
491 |
OBJECT cset[MAXCSET+MAXSET+1]; |
492 |
register int i, j; |
493 |
int k; |
494 |
/* copy os in place, cset <- cs */ |
495 |
cset[0] = 0; |
496 |
k = 0; |
497 |
for (i = j = 1; i <= os[0]; i++) { |
498 |
while (j <= cs[0] && cs[j] < os[i]) |
499 |
cset[++cset[0]] = cs[j++]; |
500 |
if (j > cs[0] || os[i] != cs[j]) { /* object to check */ |
501 |
os[++k] = os[i]; |
502 |
cset[++cset[0]] = os[i]; |
503 |
} |
504 |
} |
505 |
if (!(os[0] = k)) /* new "to check" set size */ |
506 |
return; /* special case */ |
507 |
while (j <= cs[0]) /* get the rest of cs */ |
508 |
cset[++cset[0]] = cs[j++]; |
509 |
if (cset[0] > MAXCSET) /* truncate "checked" set if nec. */ |
510 |
cset[0] = MAXCSET; |
511 |
/* setcopy(cs, cset); */ /* copy cset back to cs */ |
512 |
os = cset; |
513 |
for (i = os[0]; i-- >= 0; ) |
514 |
*cs++ = *os++; |
515 |
} |