ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/rt/srcsamp.c
Revision: 2.23
Committed: Fri Dec 13 00:50:55 2024 UTC (5 months ago) by greg
Content type: text/plain
Branch: MAIN
Changes since 2.22: +1 -3 lines
Log Message:
perf: Removed debug statement

File Contents

# User Rev Content
1 greg 1.1 #ifndef lint
2 greg 2.23 static const char RCSid[] = "$Id: srcsamp.c,v 2.22 2024/11/15 20:47:42 greg Exp $";
3 greg 1.1 #endif
4     /*
5     * Source sampling routines
6 greg 2.7 *
7     * External symbols declared in source.h
8     */
9    
10 greg 2.8 #include "copyright.h"
11 greg 1.1
12 greg 1.4 #include "ray.h"
13 greg 1.1
14     #include "source.h"
15    
16     #include "random.h"
17    
18 greg 2.22 #ifdef SSKIPOPT
19     /* The following table is used for skipping sources */
20     static uby8 *srcskipflags = NULL; /* source inclusion lookup */
21     static int ssf_count = 0; /* number of flag entries */
22     static int ssf_max = 0; /* current array size */
23     static uby8 *ssf_noskip = NULL; /* set of zero flags */
24    
25     uby8 *ssf_select = NULL; /* sources we may skip */
26    
27     /* Find/allocate source skip flag entry (free all if NULL) */
28     int
29     sskip_rsi(uby8 *flags)
30     {
31     uby8 *flp;
32     int i;
33    
34     if (flags == NULL) { /* means clear all */
35     efree(srcskipflags); srcskipflags = NULL;
36     ssf_count = ssf_max = 0;
37     sskip_free(ssf_noskip);
38     sskip_free(ssf_select);
39     return(0);
40     }
41     if (ssf_noskip == NULL) /* first call? */
42     ssf_noskip = sskip_new();
43    
44     if (sskip_eq(flags, ssf_noskip))
45     return(-1); /* nothing to skip */
46     /* search recent entries */
47     flp = srcskipflags + ssf_count*SSKIPFLSIZ;
48     for (i = ssf_count; i-- > 0; )
49     if (sskip_eq(flp -= SSKIPFLSIZ, flags))
50     return(-2-i); /* found it! */
51     /* else tack on new entry */
52     if (ssf_count >= ssf_max) { /* need more space? */
53     ssf_max = ssf_count + (ssf_count>>2) + 64;
54     if (ssf_max <= ssf_count &&
55     (ssf_max = ssf_count+1024) <= ssf_count)
56     error(SYSTEM, "out of space in sskip_rsi()");
57    
58     srcskipflags = (uby8 *)erealloc(srcskipflags,
59     ssf_max*SSKIPFLSIZ);
60     }
61     sskip_cpy(srcskipflags + ssf_count*SSKIPFLSIZ, flags);
62    
63     return(-2 - ssf_count++); /* return index (< -1) */
64     }
65    
66     /* Get skip flags associated with RAY rsrc index (or NULL) */
67     uby8 *
68     sskip_flags(int rsi)
69     {
70     if (rsi >= -1)
71     return(ssf_noskip);
72    
73     if ((rsi = -2 - rsi) >= ssf_count)
74     error(CONSISTENCY, "bad index to sskip_flags()");
75    
76     return(srcskipflags + rsi*SSKIPFLSIZ);
77     }
78    
79     /* OR in a second set of flags into a first */
80     void
81     sskip_addflags(uby8 *dfl, const uby8 *sfl)
82     {
83     int nb = SSKIPFLSIZ;
84    
85     while (nb--)
86     *dfl++ |= *sfl++;
87     }
88     #endif
89 greg 1.1
90 greg 2.21 int
91     srcskip( /* pre-emptive test for source to skip */
92     int sn,
93     RAY *r
94 greg 2.18 )
95     {
96 greg 2.21 SRCREC *sp = source + sn;
97    
98 greg 2.18 if (sp->sflags & SSKIP)
99     return(1);
100 greg 2.22 #ifdef SSKIPOPT
101     if (r->rsrc < -1 && /* ray has custom skip flags? */
102     sskip_chk(sskip_flags(r->rsrc), sn))
103     return(1);
104     #endif
105 greg 2.18 if ((sp->sflags & (SPROX|SDISTANT)) != SPROX)
106     return(0);
107    
108 greg 2.21 return(dist2(r->rorg, sp->sloc) >
109 greg 2.18 (sp->sl.prox + sp->srad)*(sp->sl.prox + sp->srad));
110     }
111 greg 2.5
112 greg 1.1 double
113 greg 2.18 nextssamp( /* compute sample for source, rtn. distance */
114     RAY *r, /* origin is read, direction is set */
115 greg 2.21 SRCINDEX *si /* source index (modified to current) */
116 greg 2.18 )
117 greg 1.1 {
118     int cent[3], size[3], parr[2];
119 greg 2.16 SRCREC *srcp;
120 greg 2.19 double vpos[3];
121 greg 1.1 double d;
122 greg 2.18 int i;
123 greg 2.2 nextsample:
124 greg 1.1 while (++si->sp >= si->np) { /* get next sample */
125     if (++si->sn >= nsources)
126     return(0.0); /* no more */
127 greg 2.21 if (srcskip(si->sn, r))
128 greg 1.7 si->np = 0;
129     else if (srcsizerat <= FTINY)
130 greg 1.4 nopart(si, r);
131 greg 1.1 else {
132     for (i = si->sn; source[i].sflags & SVIRTUAL;
133     i = source[i].sa.sv.sn)
134     ; /* partition source */
135 greg 1.4 (*sfun[source[i].so->otype].of->partit)(si, r);
136 greg 1.1 }
137     si->sp = -1;
138     }
139     /* get partition */
140     cent[0] = cent[1] = cent[2] = 0;
141     size[0] = size[1] = size[2] = MAXSPART;
142     parr[0] = 0; parr[1] = si->sp;
143     if (!skipparts(cent, size, parr, si->spt))
144     error(CONSISTENCY, "bad source partition in nextssamp");
145     /* compute sample */
146 greg 2.16 srcp = source + si->sn;
147 greg 1.1 if (dstrsrc > FTINY) { /* jitter sample */
148     dimlist[ndims] = si->sn + 8831;
149     dimlist[ndims+1] = si->sp + 3109;
150     d = urand(ilhash(dimlist,ndims+2)+samplendx);
151 greg 2.16 if (srcp->sflags & SFLAT) {
152 greg 1.1 multisamp(vpos, 2, d);
153 greg 2.12 vpos[SW] = 0.5;
154 greg 1.1 } else
155     multisamp(vpos, 3, d);
156     for (i = 0; i < 3; i++)
157     vpos[i] = dstrsrc * (1. - 2.*vpos[i]) *
158 greg 2.17 (double)size[i]*(1.0/MAXSPART);
159 greg 1.1 } else
160     vpos[0] = vpos[1] = vpos[2] = 0.0;
161    
162 greg 2.17 VSUM(vpos, vpos, cent, 1.0/MAXSPART);
163 greg 2.12 /* avoid circular aiming failures */
164 greg 2.20 if ((srcp->sflags & SCIR) && (si->np > 1) | (dstrsrc > 0.7)) {
165 greg 2.12 FVECT trim;
166 greg 2.16 if (srcp->sflags & (SFLAT|SDISTANT)) {
167 greg 2.12 d = 1.12837917; /* correct setflatss() */
168     trim[SU] = d*sqrt(1.0 - 0.5*vpos[SV]*vpos[SV]);
169     trim[SV] = d*sqrt(1.0 - 0.5*vpos[SU]*vpos[SU]);
170     trim[SW] = 0.0;
171     } else {
172     trim[SW] = trim[SU] = vpos[SU]*vpos[SU];
173     d = vpos[SV]*vpos[SV];
174     if (d > trim[SW]) trim[SW] = d;
175     trim[SU] += d;
176     d = vpos[SW]*vpos[SW];
177     if (d > trim[SW]) trim[SW] = d;
178     trim[SU] += d;
179 greg 2.15 if (trim[SU] > FTINY*FTINY) {
180     d = 1.0/0.7236; /* correct sphsetsrc() */
181     trim[SW] = trim[SV] = trim[SU] =
182     d*sqrt(trim[SW]/trim[SU]);
183     } else
184     trim[SW] = trim[SV] = trim[SU] = 0.0;
185 greg 2.12 }
186     for (i = 0; i < 3; i++)
187     vpos[i] *= trim[i];
188     }
189 greg 1.1 /* compute direction */
190     for (i = 0; i < 3; i++)
191 greg 2.16 r->rdir[i] = srcp->sloc[i] +
192     vpos[SU]*srcp->ss[SU][i] +
193     vpos[SV]*srcp->ss[SV][i] +
194     vpos[SW]*srcp->ss[SW][i];
195 greg 1.1
196 greg 2.16 if (!(srcp->sflags & SDISTANT))
197 greg 2.17 VSUB(r->rdir, r->rdir, r->rorg);
198 greg 1.1 /* compute distance */
199 greg 1.4 if ((d = normalize(r->rdir)) == 0.0)
200 greg 2.2 goto nextsample; /* at source! */
201 greg 1.1
202     /* compute sample size */
203 greg 2.16 if (srcp->sflags & SFLAT) {
204 greg 2.6 si->dom = sflatform(si->sn, r->rdir);
205 greg 2.17 si->dom *= size[SU]*size[SV]*(1.0/MAXSPART/MAXSPART);
206 greg 2.16 } else if (srcp->sflags & SCYL) {
207 greg 2.6 si->dom = scylform(si->sn, r->rdir);
208 greg 2.17 si->dom *= size[SU]*(1.0/MAXSPART);
209 greg 1.1 } else {
210 greg 2.17 si->dom = size[SU]*size[SV]*(double)size[SW] *
211     (1.0/MAXSPART/MAXSPART/MAXSPART) ;
212 greg 1.1 }
213 greg 2.16 if (srcp->sflags & SDISTANT) {
214     si->dom *= srcp->ss2;
215 greg 1.1 return(FHUGE);
216 greg 2.6 }
217 greg 2.3 if (si->dom <= 1e-4)
218 greg 2.2 goto nextsample; /* behind source? */
219 greg 2.16 si->dom *= srcp->ss2/(d*d);
220 greg 1.1 return(d); /* sample OK, return distance */
221     }
222    
223    
224 greg 2.7 int
225 greg 2.18 skipparts( /* skip to requested partition */
226     int ct[3],
227     int sz[3], /* center and size of partition (returned) */
228     int pp[2], /* current index, number to skip (modified) */
229     unsigned char *pt /* partition array */
230     )
231 greg 1.1 {
232 greg 2.18 int p;
233 greg 1.1 /* check this partition */
234     p = spart(pt, pp[0]);
235     pp[0]++;
236 schorsch 2.10 if (p == S0) { /* leaf partition */
237 greg 1.1 if (pp[1]) {
238     pp[1]--;
239     return(0); /* not there yet */
240     } else
241     return(1); /* we've arrived */
242 schorsch 2.10 }
243 greg 1.1 /* else check lower */
244     sz[p] >>= 1;
245     ct[p] -= sz[p];
246     if (skipparts(ct, sz, pp, pt))
247     return(1); /* return hit */
248     /* else check upper */
249     ct[p] += sz[p] << 1;
250     if (skipparts(ct, sz, pp, pt))
251     return(1); /* return hit */
252     /* else return to starting position */
253     ct[p] -= sz[p];
254     sz[p] <<= 1;
255     return(0); /* return miss */
256     }
257    
258    
259 greg 2.7 void
260 greg 2.18 nopart( /* single source partition */
261     SRCINDEX *si,
262     RAY *r
263     )
264 greg 1.1 {
265     clrpart(si->spt);
266     setpart(si->spt, 0, S0);
267     si->np = 1;
268     }
269    
270    
271     static int
272 greg 2.18 cyl_partit( /* slice a cylinder */
273     FVECT ro,
274     unsigned char *pt,
275     int *pi,
276     int mp,
277     FVECT cent,
278     FVECT axis,
279     double d2
280     )
281 greg 1.1 {
282     FVECT newct, newax;
283     int npl, npu;
284    
285     if (mp < 2 || dist2(ro, cent) >= d2) { /* hit limit? */
286     setpart(pt, *pi, S0);
287     (*pi)++;
288     return(1);
289     }
290     /* subdivide */
291     setpart(pt, *pi, SU);
292     (*pi)++;
293     newax[0] = .5*axis[0];
294     newax[1] = .5*axis[1];
295     newax[2] = .5*axis[2];
296     d2 *= 0.25;
297     /* lower half */
298     newct[0] = cent[0] - newax[0];
299     newct[1] = cent[1] - newax[1];
300     newct[2] = cent[2] - newax[2];
301 greg 1.2 npl = cyl_partit(ro, pt, pi, mp/2, newct, newax, d2);
302 greg 1.1 /* upper half */
303     newct[0] = cent[0] + newax[0];
304     newct[1] = cent[1] + newax[1];
305     newct[2] = cent[2] + newax[2];
306 greg 1.2 npu = cyl_partit(ro, pt, pi, mp/2, newct, newax, d2);
307 greg 1.1 /* return total */
308     return(npl + npu);
309     }
310    
311    
312 greg 2.7 void
313 greg 2.18 cylpart( /* partition a cylinder */
314     SRCINDEX *si,
315     RAY *r
316     )
317 greg 1.1 {
318 greg 2.18 double dist2, safedist2, dist2cent, rad2;
319 greg 1.5 FVECT v;
320 greg 2.18 SRCREC *sp;
321 greg 1.1 int pi;
322 greg 2.18 /* first check point location */
323 greg 1.5 clrpart(si->spt);
324 greg 2.18 sp = source + si->sn;
325     rad2 = 1.365 * DOT(sp->ss[SV],sp->ss[SV]);
326     v[0] = r->rorg[0] - sp->sloc[0];
327     v[1] = r->rorg[1] - sp->sloc[1];
328     v[2] = r->rorg[2] - sp->sloc[2];
329     dist2 = DOT(v,sp->ss[SU]);
330     safedist2 = DOT(sp->ss[SU],sp->ss[SU]);
331     dist2 *= dist2 / safedist2;
332     dist2cent = DOT(v,v);
333     dist2 = dist2cent - dist2;
334     if (dist2 <= rad2) { /* point inside extended cylinder */
335 greg 1.5 si->np = 0;
336     return;
337     }
338 greg 2.18 safedist2 *= 4.*r->rweight*r->rweight/(srcsizerat*srcsizerat);
339     if (dist2 <= 4.*rad2 || /* point too close to subdivide */
340     dist2cent >= safedist2) { /* or too far */
341     setpart(si->spt, 0, S0);
342     si->np = 1;
343     return;
344     }
345 greg 1.1 pi = 0;
346 greg 2.18 si->np = cyl_partit(r->rorg, si->spt, &pi, MAXSPART,
347     sp->sloc, sp->ss[SU], safedist2);
348 greg 1.1 }
349    
350    
351     static int
352 greg 2.18 flt_partit( /* partition flatty */
353     FVECT ro,
354     unsigned char *pt,
355     int *pi,
356     int mp,
357     FVECT cent,
358     FVECT u,
359     FVECT v,
360     double du2,
361     double dv2
362     )
363 greg 1.1 {
364     double d2;
365     FVECT newct, newax;
366     int npl, npu;
367    
368     if (mp < 2 || ((d2 = dist2(ro, cent)) >= du2
369     && d2 >= dv2)) { /* hit limit? */
370     setpart(pt, *pi, S0);
371     (*pi)++;
372     return(1);
373     }
374     if (du2 > dv2) { /* subdivide in U */
375     setpart(pt, *pi, SU);
376     (*pi)++;
377     newax[0] = .5*u[0];
378     newax[1] = .5*u[1];
379     newax[2] = .5*u[2];
380     u = newax;
381     du2 *= 0.25;
382     } else { /* subdivide in V */
383     setpart(pt, *pi, SV);
384     (*pi)++;
385     newax[0] = .5*v[0];
386     newax[1] = .5*v[1];
387     newax[2] = .5*v[2];
388     v = newax;
389     dv2 *= 0.25;
390     }
391     /* lower half */
392     newct[0] = cent[0] - newax[0];
393     newct[1] = cent[1] - newax[1];
394     newct[2] = cent[2] - newax[2];
395 greg 1.2 npl = flt_partit(ro, pt, pi, mp/2, newct, u, v, du2, dv2);
396 greg 1.1 /* upper half */
397     newct[0] = cent[0] + newax[0];
398     newct[1] = cent[1] + newax[1];
399     newct[2] = cent[2] + newax[2];
400 greg 1.2 npu = flt_partit(ro, pt, pi, mp/2, newct, u, v, du2, dv2);
401 greg 1.1 /* return total */
402     return(npl + npu);
403     }
404    
405    
406 greg 2.18 void
407     flatpart( /* partition a flat source */
408     SRCINDEX *si,
409     RAY *r
410     )
411     {
412     RREAL *vp;
413     FVECT v;
414     double du2, dv2;
415     int pi;
416    
417     clrpart(si->spt);
418     vp = source[si->sn].sloc;
419     v[0] = r->rorg[0] - vp[0];
420     v[1] = r->rorg[1] - vp[1];
421     v[2] = r->rorg[2] - vp[2];
422     vp = source[si->sn].snorm;
423     if (DOT(v,vp) <= 0.) { /* behind source */
424     si->np = 0;
425     return;
426     }
427     dv2 = 2.*r->rweight/srcsizerat;
428     dv2 *= dv2;
429     vp = source[si->sn].ss[SU];
430     du2 = dv2 * DOT(vp,vp);
431     vp = source[si->sn].ss[SV];
432     dv2 *= DOT(vp,vp);
433     pi = 0;
434     si->np = flt_partit(r->rorg, si->spt, &pi, MAXSPART,
435     source[si->sn].sloc,
436     source[si->sn].ss[SU], source[si->sn].ss[SV], du2, dv2);
437     }
438    
439    
440 greg 1.1 double
441 greg 2.18 scylform( /* compute cosine for cylinder's projection */
442     int sn,
443     FVECT dir /* assume normalized */
444     )
445 greg 1.1 {
446 greg 2.18 RREAL *dv;
447 greg 1.1 double d;
448    
449     dv = source[sn].ss[SU];
450     d = DOT(dir, dv);
451     d *= d / DOT(dv,dv);
452     return(sqrt(1. - d));
453     }