ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/raytrace.c
Revision: 2.66
Committed: Tue Feb 24 19:39:27 2015 UTC (9 years, 2 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 2.65: +12 -6 lines
Log Message:
Initial check-in of photon map addition by Roland Schregle

File Contents

# Content
1 #ifndef lint
2 static const char RCSid[] = "$Id: raytrace.c,v 1.2 2014/12/01 17:32:36 taschreg Exp taschreg $";
3 #endif
4 /*
5 * raytrace.c - routines for tracing and shading rays.
6 *
7 * External symbols declared in ray.h
8 */
9
10 #include "copyright.h"
11
12 #include "ray.h"
13 #include "source.h"
14 #include "otypes.h"
15 #include "otspecial.h"
16 #include "random.h"
17 #include "pmap.h"
18
19 #define MAXCSET ((MAXSET+1)*2-1) /* maximum check set size */
20
21 RNUMBER raynum = 0; /* next unique ray number */
22 RNUMBER nrays = 0; /* number of calls to localhit */
23
24 static RREAL Lambfa[5] = {PI, PI, PI, 0.0, 0.0};
25 OBJREC Lamb = {
26 OVOID, MAT_PLASTIC, "Lambertian",
27 {NULL, Lambfa, 0, 5}, NULL
28 }; /* a Lambertian surface */
29
30 OBJREC Aftplane; /* aft clipping plane object */
31
32 #define RAYHIT (-1) /* return value for intercepted ray */
33
34 static int raymove(FVECT pos, OBJECT *cxs, int dirf, RAY *r, CUBE *cu);
35 static int checkhit(RAY *r, CUBE *cu, OBJECT *cxs);
36 static void checkset(OBJECT *os, OBJECT *cs);
37
38
39 int
40 rayorigin( /* start new ray from old one */
41 RAY *r,
42 int rt,
43 const RAY *ro,
44 const COLOR rc
45 )
46 {
47 double rw, re;
48 /* assign coefficient/weight */
49 if (rc == NULL) {
50 rw = 1.0;
51 setcolor(r->rcoef, 1., 1., 1.);
52 } else {
53 rw = intens(rc);
54 if (rc != r->rcoef)
55 copycolor(r->rcoef, rc);
56 }
57 if ((r->parent = ro) == NULL) { /* primary ray */
58 r->rlvl = 0;
59 r->rweight = rw;
60 r->crtype = r->rtype = rt;
61 r->rsrc = -1;
62 r->clipset = NULL;
63 r->revf = raytrace;
64 copycolor(r->cext, cextinction);
65 copycolor(r->albedo, salbedo);
66 r->gecc = seccg;
67 r->slights = NULL;
68 } else { /* spawned ray */
69 if (ro->rot >= FHUGE) {
70 memset(r, 0, sizeof(RAY));
71 return(-1); /* illegal continuation */
72 }
73 r->rlvl = ro->rlvl;
74 if (rt & RAYREFL) {
75 r->rlvl++;
76 r->rsrc = -1;
77 r->clipset = ro->clipset;
78 r->rmax = 0.0;
79 } else {
80 r->rsrc = ro->rsrc;
81 r->clipset = ro->newcset;
82 r->rmax = ro->rmax <= FTINY ? 0.0 : ro->rmax - ro->rot;
83 }
84 r->revf = ro->revf;
85 copycolor(r->cext, ro->cext);
86 copycolor(r->albedo, ro->albedo);
87 r->gecc = ro->gecc;
88 r->slights = ro->slights;
89 r->crtype = ro->crtype | (r->rtype = rt);
90 VCOPY(r->rorg, ro->rop);
91 r->rweight = ro->rweight * rw;
92 /* estimate extinction */
93 re = colval(ro->cext,RED) < colval(ro->cext,GRN) ?
94 colval(ro->cext,RED) : colval(ro->cext,GRN);
95 if (colval(ro->cext,BLU) < re) re = colval(ro->cext,BLU);
96 re *= ro->rot;
97 if (re > 0.1) {
98 if (re > 92.) {
99 r->rweight = 0.0;
100 } else {
101 r->rweight *= exp(-re);
102 }
103 }
104 }
105 rayclear(r);
106 if (r->rweight <= 0.0) /* check for expiration */
107 return(-1);
108 if (r->crtype & SHADOW) /* shadow commitment */
109 return(0);
110 if (maxdepth <= 0 && rc != NULL) { /* Russian roulette */
111 if (minweight <= 0.0)
112 error(USER, "zero ray weight in Russian roulette");
113 if (maxdepth < 0 && r->rlvl > -maxdepth)
114 return(-1); /* upper reflection limit */
115 if (r->rweight >= minweight)
116 return(0);
117 if (frandom() > r->rweight/minweight)
118 return(-1);
119 rw = minweight/r->rweight; /* promote survivor */
120 scalecolor(r->rcoef, rw);
121 r->rweight = minweight;
122 return(0);
123 }
124 return(r->rweight >= minweight && r->rlvl <= abs(maxdepth) ? 0 : -1);
125 }
126
127
128 void
129 rayclear( /* clear a ray for (re)evaluation */
130 RAY *r
131 )
132 {
133 r->rno = raynum++;
134 r->newcset = r->clipset;
135 r->hitf = rayhit;
136 r->robj = OVOID;
137 r->ro = NULL;
138 r->rox = NULL;
139 r->rt = r->rot = FHUGE;
140 r->pert[0] = r->pert[1] = r->pert[2] = 0.0;
141 r->uv[0] = r->uv[1] = 0.0;
142 setcolor(r->pcol, 1.0, 1.0, 1.0);
143 setcolor(r->rcol, 0.0, 0.0, 0.0);
144 }
145
146
147 void
148 raytrace( /* trace a ray and compute its value */
149 RAY *r
150 )
151 {
152 if (localhit(r, &thescene))
153 raycont(r); /* hit local surface, evaluate */
154 else if (r->ro == &Aftplane) {
155 r->ro = NULL; /* hit aft clipping plane */
156 r->rot = FHUGE;
157 } else if (sourcehit(r))
158 rayshade(r, r->ro->omod); /* distant source */
159
160 if (trace != NULL)
161 (*trace)(r); /* trace execution */
162
163 rayparticipate(r); /* for participating medium */
164 }
165
166
167 void
168 raycont( /* check for clipped object and continue */
169 RAY *r
170 )
171 {
172 if ((r->clipset != NULL && inset(r->clipset, r->ro->omod)) ||
173 !rayshade(r, r->ro->omod))
174 raytrans(r);
175 }
176
177
178 void
179 raytrans( /* transmit ray as is */
180 RAY *r
181 )
182 {
183 RAY tr;
184
185 if (rayorigin(&tr, TRANS, r, NULL) == 0) {
186 VCOPY(tr.rdir, r->rdir);
187 rayvalue(&tr);
188 copycolor(r->rcol, tr.rcol);
189 r->rt = r->rot + tr.rt;
190 }
191 }
192
193
194 int
195 rayshade( /* shade ray r with material mod */
196 RAY *r,
197 int mod
198 )
199 {
200 OBJREC *m;
201
202 r->rt = r->rot; /* set effective ray length */
203 for ( ; mod != OVOID; mod = m->omod) {
204 m = objptr(mod);
205 /****** unnecessary test since modifier() is always called
206 if (!ismodifier(m->otype)) {
207 sprintf(errmsg, "illegal modifier \"%s\"", m->oname);
208 error(USER, errmsg);
209 }
210 ******/
211 /* hack for irradiance calculation */
212 if (do_irrad && !(r->crtype & ~(PRIMARY|TRANS)) &&
213 m->otype != MAT_CLIP &&
214 (ofun[m->otype].flags & (T_M|T_X))) {
215 if (irr_ignore(m->otype)) {
216 raytrans(r);
217 return(1);
218 }
219 if (!islight(m->otype))
220 m = &Lamb;
221 }
222 if ((*ofun[m->otype].funp)(m, r))
223 return(1); /* materials call raytexture() */
224 }
225 return(0); /* no material! */
226 }
227
228
229 void
230 rayparticipate( /* compute ray medium participation */
231 RAY *r
232 )
233 {
234 COLOR ce, ca;
235 double re, ge, be;
236
237 if (intens(r->cext) <= 1./FHUGE)
238 return; /* no medium */
239 re = r->rot*colval(r->cext,RED);
240 ge = r->rot*colval(r->cext,GRN);
241 be = r->rot*colval(r->cext,BLU);
242 if (r->crtype & SHADOW) { /* no scattering for sources */
243 re *= 1. - colval(r->albedo,RED);
244 ge *= 1. - colval(r->albedo,GRN);
245 be *= 1. - colval(r->albedo,BLU);
246 }
247 setcolor(ce, re<=FTINY ? 1. : re>92. ? 0. : exp(-re),
248 ge<=FTINY ? 1. : ge>92. ? 0. : exp(-ge),
249 be<=FTINY ? 1. : be>92. ? 0. : exp(-be));
250 multcolor(r->rcol, ce); /* path extinction */
251 if (r->crtype & SHADOW || intens(r->albedo) <= FTINY)
252 return; /* no scattering */
253
254 /* PMAP: indirect inscattering accounted for by volume photons? */
255 if (!volumePhotonMapping) {
256 setcolor(ca,
257 colval(r->albedo,RED)*colval(ambval,RED)*(1.-colval(ce,RED)),
258 colval(r->albedo,GRN)*colval(ambval,GRN)*(1.-colval(ce,GRN)),
259 colval(r->albedo,BLU)*colval(ambval,BLU)*(1.-colval(ce,BLU)));
260 addcolor(r->rcol, ca); /* ambient in scattering */
261 }
262
263 srcscatter(r); /* source in scattering */
264 }
265
266
267 void
268 raytexture( /* get material modifiers */
269 RAY *r,
270 OBJECT mod
271 )
272 {
273 OBJREC *m;
274 /* execute textures and patterns */
275 for ( ; mod != OVOID; mod = m->omod) {
276 m = objptr(mod);
277 /****** unnecessary test since modifier() is always called
278 if (!ismodifier(m->otype)) {
279 sprintf(errmsg, "illegal modifier \"%s\"", m->oname);
280 error(USER, errmsg);
281 }
282 ******/
283 if ((*ofun[m->otype].funp)(m, r)) {
284 sprintf(errmsg, "conflicting material \"%s\"",
285 m->oname);
286 objerror(r->ro, USER, errmsg);
287 }
288 }
289 }
290
291
292 int
293 raymixture( /* mix modifiers */
294 RAY *r,
295 OBJECT fore,
296 OBJECT back,
297 double coef
298 )
299 {
300 RAY fr, br;
301 int foremat, backmat;
302 int i;
303 /* bound coefficient */
304 if (coef > 1.0)
305 coef = 1.0;
306 else if (coef < 0.0)
307 coef = 0.0;
308 /* compute foreground and background */
309 foremat = backmat = 0;
310 /* foreground */
311 fr = *r;
312 if (coef > FTINY) {
313 fr.rweight *= coef;
314 scalecolor(fr.rcoef, coef);
315 foremat = rayshade(&fr, fore);
316 }
317 /* background */
318 br = *r;
319 if (coef < 1.0-FTINY) {
320 br.rweight *= 1.0-coef;
321 scalecolor(br.rcoef, 1.0-coef);
322 backmat = rayshade(&br, back);
323 }
324 /* check for transparency */
325 if (backmat ^ foremat) {
326 if (backmat && coef > FTINY)
327 raytrans(&fr);
328 else if (foremat && coef < 1.0-FTINY)
329 raytrans(&br);
330 }
331 /* mix perturbations */
332 for (i = 0; i < 3; i++)
333 r->pert[i] = coef*fr.pert[i] + (1.0-coef)*br.pert[i];
334 /* mix pattern colors */
335 scalecolor(fr.pcol, coef);
336 scalecolor(br.pcol, 1.0-coef);
337 copycolor(r->pcol, fr.pcol);
338 addcolor(r->pcol, br.pcol);
339 /* return value tells if material */
340 if (!foremat & !backmat)
341 return(0);
342 /* mix returned ray values */
343 scalecolor(fr.rcol, coef);
344 scalecolor(br.rcol, 1.0-coef);
345 copycolor(r->rcol, fr.rcol);
346 addcolor(r->rcol, br.rcol);
347 r->rt = bright(fr.rcol) > bright(br.rcol) ? fr.rt : br.rt;
348 return(1);
349 }
350
351
352 double
353 raydist( /* compute (cumulative) ray distance */
354 const RAY *r,
355 int flags
356 )
357 {
358 double sum = 0.0;
359
360 while (r != NULL && r->crtype&flags) {
361 sum += r->rot;
362 r = r->parent;
363 }
364 return(sum);
365 }
366
367
368 void
369 raycontrib( /* compute (cumulative) ray contribution */
370 RREAL rc[3],
371 const RAY *r,
372 int flags
373 )
374 {
375 double eext[3];
376 int i;
377
378 eext[0] = eext[1] = eext[2] = 0.;
379 rc[0] = rc[1] = rc[2] = 1.;
380
381 while (r != NULL && r->crtype&flags) {
382 for (i = 3; i--; ) {
383 rc[i] *= colval(r->rcoef,i);
384 eext[i] += r->rot * colval(r->cext,i);
385 }
386 r = r->parent;
387 }
388 for (i = 3; i--; )
389 rc[i] *= (eext[i] <= FTINY) ? 1. :
390 (eext[i] > 92.) ? 0. : exp(-eext[i]);
391 }
392
393
394 double
395 raynormal( /* compute perturbed normal for ray */
396 FVECT norm,
397 RAY *r
398 )
399 {
400 double newdot;
401 int i;
402
403 /* The perturbation is added to the surface normal to obtain
404 * the new normal. If the new normal would affect the surface
405 * orientation wrt. the ray, a correction is made. The method is
406 * still fraught with problems since reflected rays and similar
407 * directions calculated from the surface normal may spawn rays behind
408 * the surface. The only solution is to curb textures at high
409 * incidence (namely, keep DOT(rdir,pert) < Rdot).
410 */
411
412 for (i = 0; i < 3; i++)
413 norm[i] = r->ron[i] + r->pert[i];
414
415 if (normalize(norm) == 0.0) {
416 objerror(r->ro, WARNING, "illegal normal perturbation");
417 VCOPY(norm, r->ron);
418 return(r->rod);
419 }
420 newdot = -DOT(norm, r->rdir);
421 if ((newdot > 0.0) != (r->rod > 0.0)) { /* fix orientation */
422 for (i = 0; i < 3; i++)
423 norm[i] += 2.0*newdot*r->rdir[i];
424 newdot = -newdot;
425 }
426 return(newdot);
427 }
428
429
430 void
431 newrayxf( /* get new tranformation matrix for ray */
432 RAY *r
433 )
434 {
435 static struct xfn {
436 struct xfn *next;
437 FULLXF xf;
438 } xfseed = { &xfseed }, *xflast = &xfseed;
439 struct xfn *xp;
440 const RAY *rp;
441
442 /*
443 * Search for transform in circular list that
444 * has no associated ray in the tree.
445 */
446 xp = xflast;
447 for (rp = r->parent; rp != NULL; rp = rp->parent)
448 if (rp->rox == &xp->xf) { /* xp in use */
449 xp = xp->next; /* move to next */
450 if (xp == xflast) { /* need new one */
451 xp = (struct xfn *)bmalloc(sizeof(struct xfn));
452 if (xp == NULL)
453 error(SYSTEM,
454 "out of memory in newrayxf");
455 /* insert in list */
456 xp->next = xflast->next;
457 xflast->next = xp;
458 break; /* we're done */
459 }
460 rp = r; /* start check over */
461 }
462 /* got it */
463 r->rox = &xp->xf;
464 xflast = xp;
465 }
466
467
468 void
469 flipsurface( /* reverse surface orientation */
470 RAY *r
471 )
472 {
473 r->rod = -r->rod;
474 r->ron[0] = -r->ron[0];
475 r->ron[1] = -r->ron[1];
476 r->ron[2] = -r->ron[2];
477 r->pert[0] = -r->pert[0];
478 r->pert[1] = -r->pert[1];
479 r->pert[2] = -r->pert[2];
480 }
481
482
483 void
484 rayhit( /* standard ray hit test */
485 OBJECT *oset,
486 RAY *r
487 )
488 {
489 OBJREC *o;
490 int i;
491
492 for (i = oset[0]; i > 0; i--) {
493 o = objptr(oset[i]);
494 if ((*ofun[o->otype].funp)(o, r))
495 r->robj = oset[i];
496 }
497 }
498
499
500 int
501 localhit( /* check for hit in the octree */
502 RAY *r,
503 CUBE *scene
504 )
505 {
506 OBJECT cxset[MAXCSET+1]; /* set of checked objects */
507 FVECT curpos; /* current cube position */
508 int sflags; /* sign flags */
509 double t, dt;
510 int i;
511
512 nrays++; /* increment trace counter */
513 sflags = 0;
514 for (i = 0; i < 3; i++) {
515 curpos[i] = r->rorg[i];
516 if (r->rdir[i] > 1e-7)
517 sflags |= 1 << i;
518 else if (r->rdir[i] < -1e-7)
519 sflags |= 0x10 << i;
520 }
521 if (!sflags) {
522 error(WARNING, "zero ray direction in localhit");
523 return(0);
524 }
525 /* start off assuming nothing hit */
526 if (r->rmax > FTINY) { /* except aft plane if one */
527 r->ro = &Aftplane;
528 r->rot = r->rmax;
529 VSUM(r->rop, r->rorg, r->rdir, r->rot);
530 }
531 /* find global cube entrance point */
532 t = 0.0;
533 if (!incube(scene, curpos)) {
534 /* find distance to entry */
535 for (i = 0; i < 3; i++) {
536 /* plane in our direction */
537 if (sflags & 1<<i)
538 dt = scene->cuorg[i];
539 else if (sflags & 0x10<<i)
540 dt = scene->cuorg[i] + scene->cusize;
541 else
542 continue;
543 /* distance to the plane */
544 dt = (dt - r->rorg[i])/r->rdir[i];
545 if (dt > t)
546 t = dt; /* farthest face is the one */
547 }
548 t += FTINY; /* fudge to get inside cube */
549 if (t >= r->rot) /* clipped already */
550 return(0);
551 /* advance position */
552 VSUM(curpos, curpos, r->rdir, t);
553
554 if (!incube(scene, curpos)) /* non-intersecting ray */
555 return(0);
556 }
557 cxset[0] = 0;
558 raymove(curpos, cxset, sflags, r, scene);
559 return((r->ro != NULL) & (r->ro != &Aftplane));
560 }
561
562
563 static int
564 raymove( /* check for hit as we move */
565 FVECT pos, /* current position, modified herein */
566 OBJECT *cxs, /* checked objects, modified by checkhit */
567 int dirf, /* direction indicators to speed tests */
568 RAY *r,
569 CUBE *cu
570 )
571 {
572 int ax;
573 double dt, t;
574
575 if (istree(cu->cutree)) { /* recurse on subcubes */
576 CUBE cukid;
577 int br, sgn;
578
579 cukid.cusize = cu->cusize * 0.5; /* find subcube */
580 VCOPY(cukid.cuorg, cu->cuorg);
581 br = 0;
582 if (pos[0] >= cukid.cuorg[0]+cukid.cusize) {
583 cukid.cuorg[0] += cukid.cusize;
584 br |= 1;
585 }
586 if (pos[1] >= cukid.cuorg[1]+cukid.cusize) {
587 cukid.cuorg[1] += cukid.cusize;
588 br |= 2;
589 }
590 if (pos[2] >= cukid.cuorg[2]+cukid.cusize) {
591 cukid.cuorg[2] += cukid.cusize;
592 br |= 4;
593 }
594 for ( ; ; ) {
595 cukid.cutree = octkid(cu->cutree, br);
596 if ((ax = raymove(pos,cxs,dirf,r,&cukid)) == RAYHIT)
597 return(RAYHIT);
598 sgn = 1 << ax;
599 if (sgn & dirf) /* positive axis? */
600 if (sgn & br)
601 return(ax); /* overflow */
602 else {
603 cukid.cuorg[ax] += cukid.cusize;
604 br |= sgn;
605 }
606 else
607 if (sgn & br) {
608 cukid.cuorg[ax] -= cukid.cusize;
609 br &= ~sgn;
610 } else
611 return(ax); /* underflow */
612 }
613 /*NOTREACHED*/
614 }
615 if (isfull(cu->cutree)) {
616 if (checkhit(r, cu, cxs))
617 return(RAYHIT);
618 } else if (r->ro == &Aftplane && incube(cu, r->rop))
619 return(RAYHIT);
620 /* advance to next cube */
621 if (dirf&0x11) {
622 dt = dirf&1 ? cu->cuorg[0] + cu->cusize : cu->cuorg[0];
623 t = (dt - pos[0])/r->rdir[0];
624 ax = 0;
625 } else
626 t = FHUGE;
627 if (dirf&0x22) {
628 dt = dirf&2 ? cu->cuorg[1] + cu->cusize : cu->cuorg[1];
629 dt = (dt - pos[1])/r->rdir[1];
630 if (dt < t) {
631 t = dt;
632 ax = 1;
633 }
634 }
635 if (dirf&0x44) {
636 dt = dirf&4 ? cu->cuorg[2] + cu->cusize : cu->cuorg[2];
637 dt = (dt - pos[2])/r->rdir[2];
638 if (dt < t) {
639 t = dt;
640 ax = 2;
641 }
642 }
643 VSUM(pos, pos, r->rdir, t);
644 return(ax);
645 }
646
647
648 static int
649 checkhit( /* check for hit in full cube */
650 RAY *r,
651 CUBE *cu,
652 OBJECT *cxs
653 )
654 {
655 OBJECT oset[MAXSET+1];
656
657 objset(oset, cu->cutree);
658 checkset(oset, cxs); /* avoid double-checking */
659
660 (*r->hitf)(oset, r); /* test for hit in set */
661
662 if (r->robj == OVOID)
663 return(0); /* no scores yet */
664
665 return(incube(cu, r->rop)); /* hit OK if in current cube */
666 }
667
668
669 static void
670 checkset( /* modify checked set and set to check */
671 OBJECT *os, /* os' = os - cs */
672 OBJECT *cs /* cs' = cs + os */
673 )
674 {
675 OBJECT cset[MAXCSET+MAXSET+1];
676 int i, j;
677 int k;
678 /* copy os in place, cset <- cs */
679 cset[0] = 0;
680 k = 0;
681 for (i = j = 1; i <= os[0]; i++) {
682 while (j <= cs[0] && cs[j] < os[i])
683 cset[++cset[0]] = cs[j++];
684 if (j > cs[0] || os[i] != cs[j]) { /* object to check */
685 os[++k] = os[i];
686 cset[++cset[0]] = os[i];
687 }
688 }
689 if (!(os[0] = k)) /* new "to check" set size */
690 return; /* special case */
691 while (j <= cs[0]) /* get the rest of cs */
692 cset[++cset[0]] = cs[j++];
693 if (cset[0] > MAXCSET) /* truncate "checked" set if nec. */
694 cset[0] = MAXCSET;
695 /* setcopy(cs, cset); */ /* copy cset back to cs */
696 os = cset;
697 for (i = os[0]; i-- >= 0; )
698 *cs++ = *os++;
699 }