1 |
– |
/* Copyright (c) 1991 Regents of the University of California */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Source sampling routines |
6 |
+ |
* |
7 |
+ |
* External symbols declared in source.h |
8 |
|
*/ |
9 |
|
|
10 |
+ |
#include "copyright.h" |
11 |
+ |
|
12 |
|
#include "ray.h" |
13 |
|
|
14 |
|
#include "source.h" |
16 |
|
#include "random.h" |
17 |
|
|
18 |
|
|
19 |
+ |
static int cyl_partit(), flt_partit(); |
20 |
+ |
|
21 |
+ |
|
22 |
|
double |
23 |
|
nextssamp(r, si) /* compute sample for source, rtn. distance */ |
24 |
|
register RAY *r; /* origin is read, direction is set */ |
57 |
|
d = urand(ilhash(dimlist,ndims+2)+samplendx); |
58 |
|
if (source[si->sn].sflags & SFLAT) { |
59 |
|
multisamp(vpos, 2, d); |
60 |
< |
vpos[2] = 0.5; |
60 |
> |
vpos[SW] = 0.5; |
61 |
|
} else |
62 |
|
multisamp(vpos, 3, d); |
63 |
|
for (i = 0; i < 3; i++) |
68 |
|
|
69 |
|
for (i = 0; i < 3; i++) |
70 |
|
vpos[i] += (double)cent[i]/MAXSPART; |
71 |
+ |
/* avoid circular aiming failures */ |
72 |
+ |
if ((source[si->sn].sflags & SCIR) && (si->np > 1 || dstrsrc > 0.7)) { |
73 |
+ |
FVECT trim; |
74 |
+ |
if (source[si->sn].sflags & (SFLAT|SDISTANT)) { |
75 |
+ |
d = 1.12837917; /* correct setflatss() */ |
76 |
+ |
trim[SU] = d*sqrt(1.0 - 0.5*vpos[SV]*vpos[SV]); |
77 |
+ |
trim[SV] = d*sqrt(1.0 - 0.5*vpos[SU]*vpos[SU]); |
78 |
+ |
trim[SW] = 0.0; |
79 |
+ |
} else { |
80 |
+ |
trim[SW] = trim[SU] = vpos[SU]*vpos[SU]; |
81 |
+ |
d = vpos[SV]*vpos[SV]; |
82 |
+ |
if (d > trim[SW]) trim[SW] = d; |
83 |
+ |
trim[SU] += d; |
84 |
+ |
d = vpos[SW]*vpos[SW]; |
85 |
+ |
if (d > trim[SW]) trim[SW] = d; |
86 |
+ |
trim[SU] += d; |
87 |
+ |
if (trim[SU] > FTINY*FTINY) { |
88 |
+ |
d = 1.0/0.7236; /* correct sphsetsrc() */ |
89 |
+ |
trim[SW] = trim[SV] = trim[SU] = |
90 |
+ |
d*sqrt(trim[SW]/trim[SU]); |
91 |
+ |
} else |
92 |
+ |
trim[SW] = trim[SV] = trim[SU] = 0.0; |
93 |
+ |
} |
94 |
+ |
for (i = 0; i < 3; i++) |
95 |
+ |
vpos[i] *= trim[i]; |
96 |
+ |
} |
97 |
|
/* compute direction */ |
98 |
|
for (i = 0; i < 3; i++) |
99 |
|
r->rdir[i] = source[si->sn].sloc[i] + |
109 |
|
goto nextsample; /* at source! */ |
110 |
|
|
111 |
|
/* compute sample size */ |
82 |
– |
si->dom = source[si->sn].ss2; |
112 |
|
if (source[si->sn].sflags & SFLAT) { |
113 |
< |
si->dom *= sflatform(si->sn, r->rdir); |
114 |
< |
si->dom *= (double)(size[SU]*size[SV])/(MAXSPART*MAXSPART); |
113 |
> |
si->dom = sflatform(si->sn, r->rdir); |
114 |
> |
si->dom *= size[SU]*size[SV]/(MAXSPART*(double)MAXSPART); |
115 |
|
} else if (source[si->sn].sflags & SCYL) { |
116 |
< |
si->dom *= scylform(si->sn, r->rdir); |
117 |
< |
si->dom *= (double)size[SU]/MAXSPART; |
116 |
> |
si->dom = scylform(si->sn, r->rdir); |
117 |
> |
si->dom *= size[SU]/(double)MAXSPART; |
118 |
|
} else { |
119 |
< |
si->dom *= (double)(size[SU]*size[SV]*size[SW]) / |
120 |
< |
(MAXSPART*MAXSPART*MAXSPART) ; |
119 |
> |
si->dom = size[SU]*size[SV]*(double)size[SW] / |
120 |
> |
(MAXSPART*MAXSPART*(double)MAXSPART) ; |
121 |
|
} |
122 |
< |
if (source[si->sn].sflags & SDISTANT) |
122 |
> |
if (source[si->sn].sflags & SDISTANT) { |
123 |
> |
si->dom *= source[si->sn].ss2; |
124 |
|
return(FHUGE); |
125 |
+ |
} |
126 |
|
if (si->dom <= 1e-4) |
127 |
|
goto nextsample; /* behind source? */ |
128 |
< |
si->dom /= d*d; |
128 |
> |
si->dom *= source[si->sn].ss2/(d*d); |
129 |
|
return(d); /* sample OK, return distance */ |
130 |
|
} |
131 |
|
|
132 |
|
|
133 |
+ |
int |
134 |
|
skipparts(ct, sz, pp, pt) /* skip to requested partition */ |
135 |
|
int ct[3], sz[3]; /* center and size of partition (returned) */ |
136 |
|
register int pp[2]; /* current index, number to skip (modified) */ |
140 |
|
/* check this partition */ |
141 |
|
p = spart(pt, pp[0]); |
142 |
|
pp[0]++; |
143 |
< |
if (p == S0) /* leaf partition */ |
143 |
> |
if (p == S0) { /* leaf partition */ |
144 |
|
if (pp[1]) { |
145 |
|
pp[1]--; |
146 |
|
return(0); /* not there yet */ |
147 |
|
} else |
148 |
|
return(1); /* we've arrived */ |
149 |
+ |
} |
150 |
|
/* else check lower */ |
151 |
|
sz[p] >>= 1; |
152 |
|
ct[p] -= sz[p]; |
163 |
|
} |
164 |
|
|
165 |
|
|
166 |
+ |
void |
167 |
|
nopart(si, r) /* single source partition */ |
168 |
|
register SRCINDEX *si; |
169 |
|
RAY *r; |
174 |
|
} |
175 |
|
|
176 |
|
|
177 |
+ |
void |
178 |
|
cylpart(si, r) /* partition a cylinder */ |
179 |
|
SRCINDEX *si; |
180 |
|
register RAY *r; |
251 |
|
} |
252 |
|
|
253 |
|
|
254 |
+ |
void |
255 |
|
flatpart(si, r) /* partition a flat source */ |
256 |
|
register SRCINDEX *si; |
257 |
|
register RAY *r; |
258 |
|
{ |
259 |
< |
register FLOAT *vp; |
259 |
> |
register RREAL *vp; |
260 |
|
FVECT v; |
261 |
|
double du2, dv2; |
262 |
|
int pi; |
267 |
|
v[1] = r->rorg[1] - vp[1]; |
268 |
|
v[2] = r->rorg[2] - vp[2]; |
269 |
|
vp = source[si->sn].snorm; |
270 |
< |
if (DOT(v,vp) <= FTINY) { /* behind source */ |
270 |
> |
if (DOT(v,vp) <= 0.) { /* behind source */ |
271 |
|
si->np = 0; |
272 |
|
return; |
273 |
|
} |
340 |
|
int sn; |
341 |
|
register FVECT dir; /* assume normalized */ |
342 |
|
{ |
343 |
< |
register FLOAT *dv; |
343 |
> |
register RREAL *dv; |
344 |
|
double d; |
345 |
|
|
346 |
|
dv = source[sn].ss[SU]; |