7 |
|
* External symbols declared in source.h |
8 |
|
*/ |
9 |
|
|
10 |
< |
/* ==================================================================== |
11 |
< |
* The Radiance Software License, Version 1.0 |
12 |
< |
* |
13 |
< |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
14 |
< |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
15 |
< |
* |
16 |
< |
* Redistribution and use in source and binary forms, with or without |
17 |
< |
* modification, are permitted provided that the following conditions |
18 |
< |
* are met: |
19 |
< |
* |
20 |
< |
* 1. Redistributions of source code must retain the above copyright |
21 |
< |
* notice, this list of conditions and the following disclaimer. |
22 |
< |
* |
23 |
< |
* 2. Redistributions in binary form must reproduce the above copyright |
24 |
< |
* notice, this list of conditions and the following disclaimer in |
25 |
< |
* the documentation and/or other materials provided with the |
26 |
< |
* distribution. |
27 |
< |
* |
28 |
< |
* 3. The end-user documentation included with the redistribution, |
29 |
< |
* if any, must include the following acknowledgment: |
30 |
< |
* "This product includes Radiance software |
31 |
< |
* (http://radsite.lbl.gov/) |
32 |
< |
* developed by the Lawrence Berkeley National Laboratory |
33 |
< |
* (http://www.lbl.gov/)." |
34 |
< |
* Alternately, this acknowledgment may appear in the software itself, |
35 |
< |
* if and wherever such third-party acknowledgments normally appear. |
36 |
< |
* |
37 |
< |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
38 |
< |
* and "The Regents of the University of California" must |
39 |
< |
* not be used to endorse or promote products derived from this |
40 |
< |
* software without prior written permission. For written |
41 |
< |
* permission, please contact [email protected]. |
42 |
< |
* |
43 |
< |
* 5. Products derived from this software may not be called "Radiance", |
44 |
< |
* nor may "Radiance" appear in their name, without prior written |
45 |
< |
* permission of Lawrence Berkeley National Laboratory. |
46 |
< |
* |
47 |
< |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
48 |
< |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
49 |
< |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
50 |
< |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
51 |
< |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
52 |
< |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
53 |
< |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
54 |
< |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
55 |
< |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
56 |
< |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
57 |
< |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
58 |
< |
* SUCH DAMAGE. |
59 |
< |
* ==================================================================== |
60 |
< |
* |
61 |
< |
* This software consists of voluntary contributions made by many |
62 |
< |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
63 |
< |
* information on Lawrence Berkeley National Laboratory, please see |
64 |
< |
* <http://www.lbl.gov/>. |
65 |
< |
*/ |
10 |
> |
#include "copyright.h" |
11 |
|
|
12 |
|
#include "ray.h" |
13 |
|
|
25 |
|
register SRCINDEX *si; /* source index (modified to current) */ |
26 |
|
{ |
27 |
|
int cent[3], size[3], parr[2]; |
28 |
+ |
SRCREC *srcp; |
29 |
|
FVECT vpos; |
30 |
|
double d; |
31 |
|
register int i; |
52 |
|
if (!skipparts(cent, size, parr, si->spt)) |
53 |
|
error(CONSISTENCY, "bad source partition in nextssamp"); |
54 |
|
/* compute sample */ |
55 |
+ |
srcp = source + si->sn; |
56 |
|
if (dstrsrc > FTINY) { /* jitter sample */ |
57 |
|
dimlist[ndims] = si->sn + 8831; |
58 |
|
dimlist[ndims+1] = si->sp + 3109; |
59 |
|
d = urand(ilhash(dimlist,ndims+2)+samplendx); |
60 |
< |
if (source[si->sn].sflags & SFLAT) { |
60 |
> |
if (srcp->sflags & SFLAT) { |
61 |
|
multisamp(vpos, 2, d); |
62 |
< |
vpos[2] = 0.5; |
62 |
> |
vpos[SW] = 0.5; |
63 |
|
} else |
64 |
|
multisamp(vpos, 3, d); |
65 |
|
for (i = 0; i < 3; i++) |
70 |
|
|
71 |
|
for (i = 0; i < 3; i++) |
72 |
|
vpos[i] += (double)cent[i]/MAXSPART; |
73 |
+ |
/* avoid circular aiming failures */ |
74 |
+ |
if ((srcp->sflags & SCIR) && (si->np > 1 || dstrsrc > 0.7)) { |
75 |
+ |
FVECT trim; |
76 |
+ |
if (srcp->sflags & (SFLAT|SDISTANT)) { |
77 |
+ |
d = 1.12837917; /* correct setflatss() */ |
78 |
+ |
trim[SU] = d*sqrt(1.0 - 0.5*vpos[SV]*vpos[SV]); |
79 |
+ |
trim[SV] = d*sqrt(1.0 - 0.5*vpos[SU]*vpos[SU]); |
80 |
+ |
trim[SW] = 0.0; |
81 |
+ |
} else { |
82 |
+ |
trim[SW] = trim[SU] = vpos[SU]*vpos[SU]; |
83 |
+ |
d = vpos[SV]*vpos[SV]; |
84 |
+ |
if (d > trim[SW]) trim[SW] = d; |
85 |
+ |
trim[SU] += d; |
86 |
+ |
d = vpos[SW]*vpos[SW]; |
87 |
+ |
if (d > trim[SW]) trim[SW] = d; |
88 |
+ |
trim[SU] += d; |
89 |
+ |
if (trim[SU] > FTINY*FTINY) { |
90 |
+ |
d = 1.0/0.7236; /* correct sphsetsrc() */ |
91 |
+ |
trim[SW] = trim[SV] = trim[SU] = |
92 |
+ |
d*sqrt(trim[SW]/trim[SU]); |
93 |
+ |
} else |
94 |
+ |
trim[SW] = trim[SV] = trim[SU] = 0.0; |
95 |
+ |
} |
96 |
+ |
for (i = 0; i < 3; i++) |
97 |
+ |
vpos[i] *= trim[i]; |
98 |
+ |
} |
99 |
|
/* compute direction */ |
100 |
|
for (i = 0; i < 3; i++) |
101 |
< |
r->rdir[i] = source[si->sn].sloc[i] + |
102 |
< |
vpos[SU]*source[si->sn].ss[SU][i] + |
103 |
< |
vpos[SV]*source[si->sn].ss[SV][i] + |
104 |
< |
vpos[SW]*source[si->sn].ss[SW][i]; |
101 |
> |
r->rdir[i] = srcp->sloc[i] + |
102 |
> |
vpos[SU]*srcp->ss[SU][i] + |
103 |
> |
vpos[SV]*srcp->ss[SV][i] + |
104 |
> |
vpos[SW]*srcp->ss[SW][i]; |
105 |
|
|
106 |
< |
if (!(source[si->sn].sflags & SDISTANT)) |
106 |
> |
if (!(srcp->sflags & SDISTANT)) |
107 |
|
for (i = 0; i < 3; i++) |
108 |
|
r->rdir[i] -= r->rorg[i]; |
109 |
|
/* compute distance */ |
111 |
|
goto nextsample; /* at source! */ |
112 |
|
|
113 |
|
/* compute sample size */ |
114 |
< |
if (source[si->sn].sflags & SFLAT) { |
114 |
> |
if (srcp->sflags & SFLAT) { |
115 |
|
si->dom = sflatform(si->sn, r->rdir); |
116 |
|
si->dom *= size[SU]*size[SV]/(MAXSPART*(double)MAXSPART); |
117 |
< |
} else if (source[si->sn].sflags & SCYL) { |
117 |
> |
} else if (srcp->sflags & SCYL) { |
118 |
|
si->dom = scylform(si->sn, r->rdir); |
119 |
|
si->dom *= size[SU]/(double)MAXSPART; |
120 |
|
} else { |
121 |
|
si->dom = size[SU]*size[SV]*(double)size[SW] / |
122 |
|
(MAXSPART*MAXSPART*(double)MAXSPART) ; |
123 |
|
} |
124 |
< |
if (source[si->sn].sflags & SDISTANT) { |
125 |
< |
si->dom *= source[si->sn].ss2; |
124 |
> |
if (srcp->sflags & SDISTANT) { |
125 |
> |
si->dom *= srcp->ss2; |
126 |
|
return(FHUGE); |
127 |
|
} |
128 |
|
if (si->dom <= 1e-4) |
129 |
|
goto nextsample; /* behind source? */ |
130 |
< |
si->dom *= source[si->sn].ss2/(d*d); |
130 |
> |
si->dom *= srcp->ss2/(d*d); |
131 |
|
return(d); /* sample OK, return distance */ |
132 |
|
} |
133 |
|
|
142 |
|
/* check this partition */ |
143 |
|
p = spart(pt, pp[0]); |
144 |
|
pp[0]++; |
145 |
< |
if (p == S0) /* leaf partition */ |
145 |
> |
if (p == S0) { /* leaf partition */ |
146 |
|
if (pp[1]) { |
147 |
|
pp[1]--; |
148 |
|
return(0); /* not there yet */ |
149 |
|
} else |
150 |
|
return(1); /* we've arrived */ |
151 |
+ |
} |
152 |
|
/* else check lower */ |
153 |
|
sz[p] >>= 1; |
154 |
|
ct[p] -= sz[p]; |
258 |
|
register SRCINDEX *si; |
259 |
|
register RAY *r; |
260 |
|
{ |
261 |
< |
register FLOAT *vp; |
261 |
> |
register RREAL *vp; |
262 |
|
FVECT v; |
263 |
|
double du2, dv2; |
264 |
|
int pi; |
269 |
|
v[1] = r->rorg[1] - vp[1]; |
270 |
|
v[2] = r->rorg[2] - vp[2]; |
271 |
|
vp = source[si->sn].snorm; |
272 |
< |
if (DOT(v,vp) <= FTINY) { /* behind source */ |
272 |
> |
if (DOT(v,vp) <= 0.) { /* behind source */ |
273 |
|
si->np = 0; |
274 |
|
return; |
275 |
|
} |
342 |
|
int sn; |
343 |
|
register FVECT dir; /* assume normalized */ |
344 |
|
{ |
345 |
< |
register FLOAT *dv; |
345 |
> |
register RREAL *dv; |
346 |
|
double d; |
347 |
|
|
348 |
|
dv = source[sn].ss[SU]; |