1 |
/* Copyright (c) 1990 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 |
extern CUBE thescene; /* our scene */ |
20 |
extern int maxdepth; /* maximum recursion depth */ |
21 |
extern double minweight; /* minimum ray weight */ |
22 |
|
23 |
long nrays = 0L; /* number of rays traced */ |
24 |
|
25 |
#define MAXLOOP 128 /* modifier loop detection */ |
26 |
|
27 |
#define RAYHIT (-1) /* return value for intercepted ray */ |
28 |
|
29 |
|
30 |
rayorigin(r, ro, rt, rw) /* start new ray from old one */ |
31 |
register RAY *r, *ro; |
32 |
int rt; |
33 |
double rw; |
34 |
{ |
35 |
if ((r->parent = ro) == NULL) { /* primary ray */ |
36 |
r->rlvl = 0; |
37 |
r->rweight = rw; |
38 |
r->crtype = r->rtype = rt; |
39 |
r->rsrc = -1; |
40 |
r->clipset = NULL; |
41 |
} else { /* spawned ray */ |
42 |
r->rlvl = ro->rlvl; |
43 |
if (rt & RAYREFL) { |
44 |
r->rlvl++; |
45 |
r->rsrc = -1; |
46 |
r->clipset = ro->clipset; |
47 |
} else { |
48 |
r->rsrc = ro->rsrc; |
49 |
r->clipset = ro->newcset; |
50 |
} |
51 |
r->rweight = ro->rweight * rw; |
52 |
r->crtype = ro->crtype | (r->rtype = rt); |
53 |
VCOPY(r->rorg, ro->rop); |
54 |
} |
55 |
r->rno = nrays; |
56 |
r->newcset = r->clipset; |
57 |
r->ro = NULL; |
58 |
r->rot = FHUGE; |
59 |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
60 |
setcolor(r->pcol, 1.0, 1.0, 1.0); |
61 |
setcolor(r->rcol, 0.0, 0.0, 0.0); |
62 |
r->rt = 0.0; |
63 |
return(r->rlvl <= maxdepth && r->rweight >= minweight ? 0 : -1); |
64 |
} |
65 |
|
66 |
|
67 |
rayvalue(r) /* compute a ray's value */ |
68 |
RAY *r; |
69 |
{ |
70 |
extern int (*trace)(); |
71 |
|
72 |
if (localhit(r, &thescene) || sourcehit(r)) |
73 |
raycont(r); |
74 |
|
75 |
if (trace != NULL) |
76 |
(*trace)(r); /* trace execution */ |
77 |
} |
78 |
|
79 |
|
80 |
raycont(r) /* check for clipped object and continue */ |
81 |
register RAY *r; |
82 |
{ |
83 |
if (r->clipset != NULL && inset(r->clipset, r->ro->omod)) |
84 |
raytrans(r); |
85 |
else |
86 |
rayshade(r, r->ro->omod); |
87 |
} |
88 |
|
89 |
|
90 |
raytrans(r) /* transmit ray as is */ |
91 |
register RAY *r; |
92 |
{ |
93 |
RAY tr; |
94 |
|
95 |
if (rayorigin(&tr, r, TRANS, 1.0) == 0) { |
96 |
VCOPY(tr.rdir, r->rdir); |
97 |
rayvalue(&tr); |
98 |
copycolor(r->rcol, tr.rcol); |
99 |
r->rt = r->rot + tr.rt; |
100 |
} |
101 |
} |
102 |
|
103 |
|
104 |
rayshade(r, mod) /* shade ray r with material mod */ |
105 |
register RAY *r; |
106 |
int mod; |
107 |
{ |
108 |
static int depth = 0; |
109 |
register OBJREC *m; |
110 |
/* check for infinite loop */ |
111 |
if (depth++ >= MAXLOOP) |
112 |
objerror(r->ro, USER, "possible modifier loop"); |
113 |
for ( ; mod != OVOID; mod = m->omod) { |
114 |
m = objptr(mod); |
115 |
/****** unnecessary test since modifier() is always called |
116 |
if (!ismodifier(m->otype)) { |
117 |
sprintf(errmsg, "illegal modifier \"%s\"", m->oname); |
118 |
error(USER, errmsg); |
119 |
} |
120 |
******/ |
121 |
(*ofun[m->otype].funp)(m, r); /* execute function */ |
122 |
m->lastrno = r->rno; |
123 |
if (ismaterial(m->otype)) { /* materials call raytexture */ |
124 |
depth--; |
125 |
return; /* we're done */ |
126 |
} |
127 |
} |
128 |
objerror(r->ro, USER, "material not found"); |
129 |
} |
130 |
|
131 |
|
132 |
raytexture(r, mod) /* get material modifiers */ |
133 |
RAY *r; |
134 |
int mod; |
135 |
{ |
136 |
static int depth = 0; |
137 |
register OBJREC *m; |
138 |
/* check for infinite loop */ |
139 |
if (depth++ >= MAXLOOP) |
140 |
objerror(r->ro, USER, "modifier loop"); |
141 |
/* execute textures and patterns */ |
142 |
for ( ; mod != OVOID; mod = m->omod) { |
143 |
m = objptr(mod); |
144 |
if (!istexture(m->otype)) { |
145 |
sprintf(errmsg, "illegal modifier \"%s\"", m->oname); |
146 |
error(USER, errmsg); |
147 |
} |
148 |
(*ofun[m->otype].funp)(m, r); |
149 |
m->lastrno = r->rno; |
150 |
} |
151 |
depth--; /* end here */ |
152 |
} |
153 |
|
154 |
|
155 |
raymixture(r, fore, back, coef) /* mix modifiers */ |
156 |
register RAY *r; |
157 |
OBJECT fore, back; |
158 |
double coef; |
159 |
{ |
160 |
FVECT curpert, forepert, backpert; |
161 |
COLOR curpcol, forepcol, backpcol; |
162 |
register int i; |
163 |
/* clip coefficient */ |
164 |
if (coef > 1.0) |
165 |
coef = 1.0; |
166 |
else if (coef < 0.0) |
167 |
coef = 0.0; |
168 |
/* save current mods */ |
169 |
VCOPY(curpert, r->pert); |
170 |
copycolor(curpcol, r->pcol); |
171 |
/* compute new mods */ |
172 |
/* foreground */ |
173 |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
174 |
setcolor(r->pcol, 1.0, 1.0, 1.0); |
175 |
if (fore != OVOID && coef > FTINY) |
176 |
raytexture(r, fore); |
177 |
VCOPY(forepert, r->pert); |
178 |
copycolor(forepcol, r->pcol); |
179 |
/* background */ |
180 |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
181 |
setcolor(r->pcol, 1.0, 1.0, 1.0); |
182 |
if (back != OVOID && coef < 1.0-FTINY) |
183 |
raytexture(r, back); |
184 |
VCOPY(backpert, r->pert); |
185 |
copycolor(backpcol, r->pcol); |
186 |
/* sum perturbations */ |
187 |
for (i = 0; i < 3; i++) |
188 |
r->pert[i] = curpert[i] + coef*forepert[i] + |
189 |
(1.0-coef)*backpert[i]; |
190 |
/* multiply colors */ |
191 |
setcolor(r->pcol, coef*colval(forepcol,RED) + |
192 |
(1.0-coef)*colval(backpcol,RED), |
193 |
coef*colval(forepcol,GRN) + |
194 |
(1.0-coef)*colval(backpcol,GRN), |
195 |
coef*colval(forepcol,BLU) + |
196 |
(1.0-coef)*colval(backpcol,BLU)); |
197 |
multcolor(r->pcol, curpcol); |
198 |
} |
199 |
|
200 |
|
201 |
double |
202 |
raynormal(norm, r) /* compute perturbed normal for ray */ |
203 |
FVECT norm; |
204 |
register RAY *r; |
205 |
{ |
206 |
double newdot; |
207 |
register int i; |
208 |
|
209 |
/* The perturbation is added to the surface normal to obtain |
210 |
* the new normal. If the new normal would affect the surface |
211 |
* orientation wrt. the ray, a correction is made. The method is |
212 |
* still fraught with problems since reflected rays and similar |
213 |
* directions calculated from the surface normal may spawn rays behind |
214 |
* the surface. The only solution is to curb textures at high |
215 |
* incidence (namely, keep DOT(rdir,pert) < Rdot). |
216 |
*/ |
217 |
|
218 |
for (i = 0; i < 3; i++) |
219 |
norm[i] = r->ron[i] + r->pert[i]; |
220 |
|
221 |
if (normalize(norm) == 0.0) { |
222 |
objerror(r->ro, WARNING, "illegal normal perturbation"); |
223 |
VCOPY(norm, r->ron); |
224 |
return(r->rod); |
225 |
} |
226 |
newdot = -DOT(norm, r->rdir); |
227 |
if ((newdot > 0.0) != (r->rod > 0.0)) { /* fix orientation */ |
228 |
for (i = 0; i < 3; i++) |
229 |
norm[i] += 2.0*newdot*r->rdir[i]; |
230 |
newdot = -newdot; |
231 |
} |
232 |
return(newdot); |
233 |
} |
234 |
|
235 |
|
236 |
newrayxf(r) /* get new tranformation matrix for ray */ |
237 |
RAY *r; |
238 |
{ |
239 |
static struct xfn { |
240 |
struct xfn *next; |
241 |
FULLXF xf; |
242 |
} xfseed = { &xfseed }, *xflast = &xfseed; |
243 |
register struct xfn *xp; |
244 |
register RAY *rp; |
245 |
|
246 |
/* |
247 |
* Search for transform in circular list that |
248 |
* has no associated ray in the tree. |
249 |
*/ |
250 |
xp = xflast; |
251 |
for (rp = r->parent; rp != NULL; rp = rp->parent) |
252 |
if (rp->rox == &xp->xf) { /* xp in use */ |
253 |
xp = xp->next; /* move to next */ |
254 |
if (xp == xflast) { /* need new one */ |
255 |
xp = (struct xfn *)bmalloc(sizeof(struct xfn)); |
256 |
if (xp == NULL) |
257 |
error(SYSTEM, |
258 |
"out of memory in newrayxf"); |
259 |
/* insert in list */ |
260 |
xp->next = xflast->next; |
261 |
xflast->next = xp; |
262 |
break; /* we're done */ |
263 |
} |
264 |
rp = r; /* start check over */ |
265 |
} |
266 |
/* got it */ |
267 |
r->rox = &xp->xf; |
268 |
xflast = xp; |
269 |
} |
270 |
|
271 |
|
272 |
flipsurface(r) /* reverse surface orientation */ |
273 |
register RAY *r; |
274 |
{ |
275 |
r->rod = -r->rod; |
276 |
r->ron[0] = -r->ron[0]; |
277 |
r->ron[1] = -r->ron[1]; |
278 |
r->ron[2] = -r->ron[2]; |
279 |
r->pert[0] = -r->pert[0]; |
280 |
r->pert[1] = -r->pert[1]; |
281 |
r->pert[2] = -r->pert[2]; |
282 |
} |
283 |
|
284 |
|
285 |
localhit(r, scene) /* check for hit in the octree */ |
286 |
register RAY *r; |
287 |
register CUBE *scene; |
288 |
{ |
289 |
FVECT curpos; /* current cube position */ |
290 |
int sflags; /* sign flags */ |
291 |
double t, dt; |
292 |
register int i; |
293 |
|
294 |
nrays++; /* increment trace counter */ |
295 |
|
296 |
sflags = 0; |
297 |
for (i = 0; i < 3; i++) { |
298 |
curpos[i] = r->rorg[i]; |
299 |
if (r->rdir[i] > FTINY) |
300 |
sflags |= 1 << i; |
301 |
else if (r->rdir[i] < -FTINY) |
302 |
sflags |= 0x10 << i; |
303 |
} |
304 |
t = 0.0; |
305 |
if (!incube(scene, curpos)) { |
306 |
/* find distance to entry */ |
307 |
for (i = 0; i < 3; i++) { |
308 |
/* plane in our direction */ |
309 |
if (sflags & 1<<i) |
310 |
dt = scene->cuorg[i]; |
311 |
else if (sflags & 0x10<<i) |
312 |
dt = scene->cuorg[i] + scene->cusize; |
313 |
else |
314 |
continue; |
315 |
/* distance to the plane */ |
316 |
dt = (dt - r->rorg[i])/r->rdir[i]; |
317 |
if (dt > t) |
318 |
t = dt; /* farthest face is the one */ |
319 |
} |
320 |
t += FTINY; /* fudge to get inside cube */ |
321 |
/* advance position */ |
322 |
for (i = 0; i < 3; i++) |
323 |
curpos[i] += r->rdir[i]*t; |
324 |
|
325 |
if (!incube(scene, curpos)) /* non-intersecting ray */ |
326 |
return(0); |
327 |
} |
328 |
return(raymove(curpos, sflags, r, scene) == RAYHIT); |
329 |
} |
330 |
|
331 |
|
332 |
static int |
333 |
raymove(pos, dirf, r, cu) /* check for hit as we move */ |
334 |
FVECT pos; /* modified */ |
335 |
int dirf; /* direction indicators to speed tests */ |
336 |
register RAY *r; |
337 |
register CUBE *cu; |
338 |
{ |
339 |
int ax; |
340 |
double dt, t; |
341 |
|
342 |
if (istree(cu->cutree)) { /* recurse on subcubes */ |
343 |
CUBE cukid; |
344 |
register int br, sgn; |
345 |
|
346 |
cukid.cusize = cu->cusize * 0.5; /* find subcube */ |
347 |
VCOPY(cukid.cuorg, cu->cuorg); |
348 |
br = 0; |
349 |
if (pos[0] >= cukid.cuorg[0]+cukid.cusize) { |
350 |
cukid.cuorg[0] += cukid.cusize; |
351 |
br |= 1; |
352 |
} |
353 |
if (pos[1] >= cukid.cuorg[1]+cukid.cusize) { |
354 |
cukid.cuorg[1] += cukid.cusize; |
355 |
br |= 2; |
356 |
} |
357 |
if (pos[2] >= cukid.cuorg[2]+cukid.cusize) { |
358 |
cukid.cuorg[2] += cukid.cusize; |
359 |
br |= 4; |
360 |
} |
361 |
for ( ; ; ) { |
362 |
cukid.cutree = octkid(cu->cutree, br); |
363 |
if ((ax = raymove(pos,dirf,r,&cukid)) == RAYHIT) |
364 |
return(RAYHIT); |
365 |
sgn = 1 << ax; |
366 |
if (sgn & dirf) /* positive axis? */ |
367 |
if (sgn & br) |
368 |
return(ax); /* overflow */ |
369 |
else { |
370 |
cukid.cuorg[ax] += cukid.cusize; |
371 |
br |= sgn; |
372 |
} |
373 |
else |
374 |
if (sgn & br) { |
375 |
cukid.cuorg[ax] -= cukid.cusize; |
376 |
br &= ~sgn; |
377 |
} else |
378 |
return(ax); /* underflow */ |
379 |
} |
380 |
/*NOTREACHED*/ |
381 |
} |
382 |
if (isfull(cu->cutree) && checkhit(r, cu)) |
383 |
return(RAYHIT); |
384 |
/* advance to next cube */ |
385 |
if (dirf&0x11) { |
386 |
dt = dirf&1 ? cu->cuorg[0] + cu->cusize : cu->cuorg[0]; |
387 |
t = (dt - pos[0])/r->rdir[0]; |
388 |
ax = 0; |
389 |
} else |
390 |
t = FHUGE; |
391 |
if (dirf&0x22) { |
392 |
dt = dirf&2 ? cu->cuorg[1] + cu->cusize : cu->cuorg[1]; |
393 |
dt = (dt - pos[1])/r->rdir[1]; |
394 |
if (dt < t) { |
395 |
t = dt; |
396 |
ax = 1; |
397 |
} |
398 |
} |
399 |
if (dirf&0x44) { |
400 |
dt = dirf&4 ? cu->cuorg[2] + cu->cusize : cu->cuorg[2]; |
401 |
dt = (dt - pos[2])/r->rdir[2]; |
402 |
if (dt < t) { |
403 |
t = dt; |
404 |
ax = 2; |
405 |
} |
406 |
} |
407 |
pos[0] += r->rdir[0]*t; |
408 |
pos[1] += r->rdir[1]*t; |
409 |
pos[2] += r->rdir[2]*t; |
410 |
return(ax); |
411 |
} |
412 |
|
413 |
|
414 |
static |
415 |
checkhit(r, cu) /* check for hit in full cube */ |
416 |
register RAY *r; |
417 |
CUBE *cu; |
418 |
{ |
419 |
OBJECT oset[MAXSET+1]; |
420 |
register OBJREC *o; |
421 |
register int i; |
422 |
|
423 |
objset(oset, cu->cutree); |
424 |
for (i = oset[0]; i > 0; i--) { |
425 |
o = objptr(oset[i]); |
426 |
if (o->lastrno == r->rno) /* checked already? */ |
427 |
continue; |
428 |
(*ofun[o->otype].funp)(o, r); |
429 |
o->lastrno = r->rno; |
430 |
} |
431 |
if (r->ro == NULL) |
432 |
return(0); /* no scores yet */ |
433 |
|
434 |
return(incube(cu, r->rop)); /* hit OK if in current cube */ |
435 |
} |