[ViewVC] Diff of: radiance/ray/src/rt/ambcomp.c

Comparing ray/src/rt/ambcomp.c (file contents):
Revision 2.73 by greg, Fri Oct 14 00:54:21 2016 UTC vs.
Revision 2.101 by greg, Tue Apr 29 23:41:10 2025 UTC

#	Line 21 \| Line 21 \| static const char RCSid[] = "$Id$";
21		#include "ambient.h"
22		#include "random.h"
23
24	<	#ifndef OLDAMB
24	>	#ifndef MINADIV
25	>	#define MINADIV 7 /* minimum # divisions in each dimension */
26	>	#endif
27	>	#ifndef MINSDIST
28	>	#define MINSDIST 0.25 /* def. min. spacing = 1/4th division */
29	>	#endif
30
26	–	extern void SDsquare2disk(double ds[2], double seedx, double seedy);
27	–
31		typedef struct {
29	–	COLOR v; /* hemisphere sample value */
30	–	float d; /* reciprocal distance (1/rt) */
32		FVECT p; /* intersection point */
33	+	float d; /* reciprocal distance */
34	+	SCOLOR v; /* hemisphere sample value */
35		} AMBSAMP; /* sample value */
36
37		typedef struct {
38		RAY rp; / originating ray sample */
39		int ns; /* number of samples per axis */
40		int sampOK; /* acquired full sample set? */
41	<	COLOR acoef; /* division contribution coefficient */
42	<	double acol[3]; /* accumulated color */
41	>	int atyp; /* RAMBIENT or TAMBIENT */
42	>	SCOLOR acoef; /* division contribution coefficient */
43	>	SCOLOR acol; /* accumulated color */
44	>	FVECT onrm; /* oriented unperturbed surface normal */
45		FVECT ux, uy; /* tangent axis unit vectors */
46		AMBSAMP sa[1]; /* sample array (extends struct) */
47		} AMBHEMI; /* ambient sample hemisphere */
#	Line 50 \| Line 55 \| typedef struct {
55		} FFTRI; /* vectors and coefficients for Hessian calculation */
56
57
58	+	#define XLOTSIZ 512 /* size of used car lot */
59	+	#define CFIRST 0 /* first corner */
60	+	#define COTHER (CFIRST+4) /* non-corner sample */
61	+	#define CMAXTARGET (int)(XLOTSIZ*MINSDIST/(1-MINSDIST))
62	+
63		static int
64	<	ambcollision( /* proposed direciton collides? */
64	>	psample_class(double ss[2]) /* classify patch sample */
65	>	{
66	>	if (ss[0] < MINSDIST) {
67	>	if (ss[1] < MINSDIST)
68	>	return(CFIRST);
69	>	if (ss[1] > 1.-MINSDIST)
70	>	return(CFIRST+2);
71	>	} else if (ss[0] > 1.-MINSDIST) {
72	>	if (ss[1] < MINSDIST)
73	>	return(CFIRST+1);
74	>	if (ss[1] > 1.-MINSDIST)
75	>	return(CFIRST+3);
76	>	}
77	>	return(COTHER); /* not in a corner */
78	>	}
79	>
80	>	static void
81	>	trade_patchsamp(double ss[2]) /* trade in problem patch position */
82	>	{
83	>	static float tradelot[XLOTSIZ][2];
84	>	static short gterm[COTHER+1];
85	>	double repl[2];
86	>	int sclass, rclass;
87	>	int x;
88	>	/* initialize lot? */
89	>	while (gterm[COTHER] < XLOTSIZ) {
90	>	tradelot[gterm[COTHER]][0] = frandom();
91	>	tradelot[gterm[COTHER]][1] = frandom();
92	>	++gterm[COTHER];
93	>	}
94	>	/* get trade-in candidate... */
95	>	sclass = psample_class(ss); /* submitted corner or not? */
96	>	switch (sclass) {
97	>	case COTHER: /* trade mid-edge with corner/any */
98	>	x = irandom( gterm[COTHER-1] > CMAXTARGET
99	>	? gterm[COTHER-1] : XLOTSIZ );
100	>	break;
101	>	case CFIRST: /* kick out of first corner */
102	>	x = gterm[CFIRST] + irandom(XLOTSIZ - gterm[CFIRST]);
103	>	break;
104	>	default: /* kick out of 2nd-4th corner */
105	>	x = irandom(XLOTSIZ - (gterm[sclass] - gterm[sclass-1]));
106	>	x += (x >= gterm[sclass-1])*(gterm[sclass] - gterm[sclass-1]);
107	>	break;
108	>	}
109	>	repl[0] = tradelot[x][0]; /* save selected replacement (result) */
110	>	repl[1] = tradelot[x][1];
111	>	/* identify replacement class */
112	>	for (rclass = CFIRST; rclass < COTHER; rclass++)
113	>	if (x < gterm[rclass])
114	>	break; /* repark to keep classes grouped */
115	>	while (rclass > sclass) { /* replacement group after submitted? */
116	>	tradelot[x][0] = tradelot[gterm[rclass-1]][0];
117	>	tradelot[x][1] = tradelot[gterm[rclass-1]][1];
118	>	x = gterm[--rclass]++;
119	>	}
120	>	while (rclass < sclass) { /* replacement group before submitted? */
121	>	tradelot[x][0] = tradelot[--gterm[rclass]][0];
122	>	tradelot[x][1] = tradelot[gterm[rclass]][1];
123	>	x = gterm[rclass++];
124	>	}
125	>	tradelot[x][0] = ss[0]; /* complete the trade-in */
126	>	tradelot[x][1] = ss[1];
127	>	ss[0] = repl[0];
128	>	ss[1] = repl[1];
129	>	}
130	>
131	>	#undef XLOTSIZ
132	>	#undef COTHER
133	>	#undef CFIRST
134	>
135	>
136	>	static int
137	>	ambcollision( /* proposed direction collides? */
138		AMBHEMI *hp,
139		int i,
140		int j,
141	<	FVECT dv
141	>	RREAL spt[2]
142		)
143		{
144	<	const double cos_thresh = 0.9999995; /* about 3.44 arcminutes */
145	<	int ii, jj;
63	<
144	>	int ii, jj;
145	>	/* check existing neighbors */
146		for (ii = i-1; ii <= i+1; ii++) {
147		if (ii < 0) continue;
148		if (ii >= hp->ns) break;
149		for (jj = j-1; jj <= j+1; jj++) {
150		AMBSAMP *ap;
151		FVECT avec;
152	<	double dprod;
152	>	double dx, dy;
153		if (jj < 0) continue;
154		if (jj >= hp->ns) break;
155		if ((ii==i) & (jj==j)) continue;
156		ap = &ambsam(hp,ii,jj);
157	<	if (ap->d <= .5/FHUGE) continue;
157	>	if (ap->d <= .5/FHUGE)
158	>	continue; /* no one home */
159		VSUB(avec, ap->p, hp->rp->rop);
160	<	dprod = DOT(avec, dv);
161	<	if (dprod >= cos_thresh*VLEN(avec))
162	<	return(1); /* collision */
160	>	normalize(avec); /* use diskworld distance */
161	>	dx = DOT(avec, hp->ux) - spt[0];
162	>	dy = DOT(avec, hp->uy) - spt[1];
163	>	if ((dxdx + dydy)(hp->nshp->ns) <
164	>	PIMINSDISTMINSDIST)
165	>	return(1); /* too close */
166		}
167		}
168	<	return(0);
168	>	return(0); /* nothing to worry about */
169		}
170
171
#	Line 91 \| Line 177 \| *ambsample( / initial ambient division sample /*
177		int n
178		)
179		{
180	+	int trade_ok = (!n & (hp->ns >= 4))*21;
181		AMBSAMP *ap = &ambsam(hp,i,j);
182		RAY ar;
183		int hlist[3], ii;
184	<	double spt[2], zd;
184	>	double ss[2];
185	>	RREAL spt[2];
186	>	double zd;
187		/* generate hemispherical sample */
188		/* ambient coefficient for weight */
189		if (ambacc > FTINY)
190	<	setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL);
190	>	setscolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL);
191		else
192	<	copycolor(ar.rcoef, hp->acoef);
193	<	if (rayorigin(&ar, AMBIENT, hp->rp, ar.rcoef) < 0)
192	>	copyscolor(ar.rcoef, hp->acoef);
193	>	if (rayorigin(&ar, hp->atyp, hp->rp, ar.rcoef) < 0)
194		return(0);
195		if (ambacc > FTINY) {
196	<	multcolor(ar.rcoef, hp->acoef);
197	<	scalecolor(ar.rcoef, 1./AVGREFL);
196	>	smultscolor(ar.rcoef, hp->acoef);
197	>	scalescolor(ar.rcoef, 1./AVGREFL);
198		}
199		hlist[0] = hp->rp->rno;
200	<	hlist[1] = j;
201	<	hlist[2] = i;
202	<	multisamp(spt, 2, urand(ilhash(hlist,3)+n));
203	<	resample:
204	<	SDsquare2disk(spt, (j+spt[1])/hp->ns, (i+spt[0])/hp->ns);
200	>	hlist[1] = AI(hp,i,j);
201	>	hlist[2] = samplendx;
202	>	multisamp(ss, 2, urand(ilhash(hlist,3)+n));
203	>	square2disk(spt, (j+ss[1])/hp->ns, (i+ss[0])/hp->ns);
204	>	/* avoid coincident samples? */
205	>	while (trade_ok-- && ambcollision(hp, i, j, spt)) {
206	>	if (trade_ok) {
207	>	trade_patchsamp(ss);
208	>	} else { /* punting... */
209	>	ss[0] = MINSDIST + (1-2MINSDIST)frandom();
210	>	ss[1] = MINSDIST + (1-2MINSDIST)frandom();
211	>	}
212	>	square2disk(spt, (j+ss[1])/hp->ns, (i+ss[0])/hp->ns);
213	>	}
214		zd = sqrt(1. - spt[0]spt[0] - spt[1]spt[1]);
215		for (ii = 3; ii--; )
216		ar.rdir[ii] = spt[0]*hp->ux[ii] +
217		spt[1]*hp->uy[ii] +
218	<	zd*hp->rp->ron[ii];
218	>	zd*hp->onrm[ii];
219		checknorm(ar.rdir);
122	–	/* avoid coincident samples */
123	–	if (!n && ambcollision(hp, i, j, ar.rdir)) {
124	–	spt[0] = frandom(); spt[1] = frandom();
125	–	goto resample;
126	–	}
220		dimlist[ndims++] = AI(hp,i,j) + 90171;
221		rayvalue(&ar); /* evaluate ray */
222		ndims--;
223	<	if (ar.rt <= FTINY)
223	>	zd = raydistance(&ar);
224	>	if (zd <= FTINY)
225		return(0); /* should never happen */
226	<	multcolor(ar.rcol, ar.rcoef); /* apply coefficient */
227	<	if (ar.rtap->d < 1.0) / new/closer distance? */
228	<	ap->d = 1.0/ar.rt;
226	>	smultscolor(ar.rcol, ar.rcoef); /* apply coefficient */
227	>	if (zdap->d < 1.0) / new/closer distance? */
228	>	ap->d = 1.0/zd;
229		if (!n) { /* record first vertex & value */
230	<	if (ar.rt > 10.0*thescene.cusize)
231	<	ar.rt = 10.0*thescene.cusize;
232	<	VSUM(ap->p, ar.rorg, ar.rdir, ar.rt);
233	<	copycolor(ap->v, ar.rcol);
230	>	if (zd > 10.0*thescene.cusize + 1000.)
231	>	zd = 10.0*thescene.cusize + 1000.;
232	>	VSUM(ap->p, ar.rorg, ar.rdir, zd);
233	>	copyscolor(ap->v, ar.rcol);
234		} else { /* else update recorded value */
235	<	hp->acol[RED] -= colval(ap->v,RED);
142	<	hp->acol[GRN] -= colval(ap->v,GRN);
143	<	hp->acol[BLU] -= colval(ap->v,BLU);
235	>	sopscolor(hp->acol, -=, ap->v);
236		zd = 1.0/(double)(n+1);
237	<	scalecolor(ar.rcol, zd);
237	>	scalescolor(ar.rcol, zd);
238		zd *= (double)n;
239	<	scalecolor(ap->v, zd);
240	<	addcolor(ap->v, ar.rcol);
239	>	scalescolor(ap->v, zd);
240	>	saddscolor(ap->v, ar.rcol);
241		}
242	<	addcolor(hp->acol, ap->v); /* add to our sum */
242	>	saddscolor(hp->acol, ap->v); /* add to our sum */
243		return(1);
244		}
245
246
247	<	/* Estimate errors based on ambient division differences */
247	>	/* Estimate variance based on ambient division differences */
248		static float *
249		getambdiffs(AMBHEMI *hp)
250		{
251	<	float earr = (float )calloc(hp->ns*hp->ns, sizeof(float));
251	>	const double normf = 1./(pbright(hp->acoef) + FTINY);
252	>	float earr = (float )calloc(2hp->nshp->ns, sizeof(float));
253		float *ep;
254		AMBSAMP *ap;
255	<	double b, d2;
255	>	double b, b1, d2;
256		int i, j;
257
258		if (earr == NULL) /* out of memory? */
259		return(NULL);
260	<	/* compute squared neighbor diffs */
261	<	for (ap = hp->sa, ep = earr, i = 0; i < hp->ns; i++)
260	>	/* sum squared neighbor diffs */
261	>	ap = hp->sa;
262	>	ep = earr + hp->nshp->ns; / original estimates to scratch */
263	>	for (i = 0; i < hp->ns; i++)
264		for (j = 0; j < hp->ns; j++, ap++, ep++) {
265	<	b = bright(ap[0].v);
265	>	b = pbright(ap[0].v);
266		if (i) { /* from above */
267	<	d2 = b - bright(ap[-hp->ns].v);
268	<	d2 *= d2;
267	>	b1 = pbright(ap[-hp->ns].v);
268	>	d2 = b - b1;
269	>	d2 = d2normf/(b + b1 + FTINY);
270		ep[0] += d2;
271		ep[-hp->ns] += d2;
272		}
273		if (!j) continue;
274		/* from behind */
275	<	d2 = b - bright(ap[-1].v);
276	<	d2 *= d2;
275	>	b1 = pbright(ap[-1].v);
276	>	d2 = b - b1;
277	>	d2 = d2normf/(b + b1 + FTINY);
278		ep[0] += d2;
279		ep[-1] += d2;
280		if (!i) continue;
281		/* diagonal */
282	<	d2 = b - bright(ap[-hp->ns-1].v);
283	<	d2 *= d2;
282	>	b1 = pbright(ap[-hp->ns-1].v);
283	>	d2 = b - b1;
284	>	d2 = d2normf/(b + b1 + FTINY);
285		ep[0] += d2;
286		ep[-hp->ns-1] += d2;
287		}
288		/* correct for number of neighbors */
289	<	earr[0] *= 8./3.;
290	<	earr[hp->ns-1] *= 8./3.;
291	<	earr[(hp->ns-1)hp->ns] = 8./3.;
292	<	earr[(hp->ns-1)hp->ns + hp->ns-1] = 8./3.;
289	>	ep = earr + hp->ns*hp->ns;
290	>	ep[0] *= 6./3.;
291	>	ep[hp->ns-1] *= 6./3.;
292	>	ep[(hp->ns-1)hp->ns] = 6./3.;
293	>	ep[(hp->ns-1)hp->ns + hp->ns-1] = 6./3.;
294		for (i = 1; i < hp->ns-1; i++) {
295	<	earr[ihp->ns] = 8./5.;
296	<	earr[ihp->ns + hp->ns-1] = 8./5.;
295	>	ep[ihp->ns] = 6./5.;
296	>	ep[ihp->ns + hp->ns-1] = 6./5.;
297		}
298		for (j = 1; j < hp->ns-1; j++) {
299	<	earr[j] *= 8./5.;
300	<	earr[(hp->ns-1)hp->ns + j] = 8./5.;
299	>	ep[j] *= 6./5.;
300	>	ep[(hp->ns-1)hp->ns + j] = 6./5.;
301		}
302	+	/* blur final map to reduce bias */
303	+	for (i = 0; i < hp->ns-1; i++) {
304	+	float *ep2;
305	+	ep = earr + i*hp->ns;
306	+	ep2 = ep + hp->ns*hp->ns;
307	+	for (j = 0; j < hp->ns-1; j++, ep++, ep2++) {
308	+	ep[0] += .5ep2[0] + .125(ep2[1] + ep2[hp->ns]);
309	+	ep[1] += .125*ep2[0];
310	+	ep[hp->ns] += .125*ep2[0];
311	+	}
312	+	}
313		return(earr);
314		}
315
#	Line 210 \| Line 320 \| *ambsupersamp(AMBHEMI hp, int cnt)**
320		{
321		float *earr = getambdiffs(hp);
322		double e2rem = 0;
213	–	AMBSAMP *ap;
323		float *ep;
324		int i, j, n, nss;
325
#	Line 220 \| Line 329 \| *ambsupersamp(AMBHEMI hp, int cnt)**
329		for (ep = earr + hp->ns*hp->ns; ep > earr; )
330		e2rem += *--ep;
331		ep = earr; /* perform super-sampling */
332	<	for (ap = hp->sa, i = 0; i < hp->ns; i++)
333	<	for (j = 0; j < hp->ns; j++, ap++) {
332	>	for (i = 0; i < hp->ns; i++)
333	>	for (j = 0; j < hp->ns; j++) {
334		if (e2rem <= FTINY)
335		goto done; /* nothing left to do */
336		nss = ep/e2remcnt + frandom();
337		for (n = 1; n <= nss && ambsample(hp,i,j,n); n++)
338	<	--cnt;
338	>	if (!--cnt) goto done;
339		e2rem -= ep++; / update remainder */
340		}
341		done:
#	Line 236 \| Line 345 \| done:
345
346		static AMBHEMI *
347		samp_hemi( /* sample indirect hemisphere */
348	<	COLOR rcol,
348	>	SCOLOR rcol,
349		RAY *r,
350		double wt
351		)
352		{
353	+	int backside = (wt < 0);
354		AMBHEMI *hp;
355		double d;
356		int n, i, j;
357	+	/* insignificance check */
358	+	d = sintens(rcol);
359	+	if (d <= FTINY)
360	+	return(NULL);
361		/* set number of divisions */
362	+	if (backside) wt = -wt;
363		if (ambacc <= FTINY &&
364	<	wt > (d = 0.8intens(rcol)r->rweight/(ambdiv*minweight)))
364	>	wt > (d = 0.8r->rweight/(ambdiv*minweight + 1e-20)))
365		wt = d; /* avoid ray termination */
366		n = sqrt(ambdiv * wt) + 0.5;
367	<	i = 1 + 5(ambacc > FTINY); / minimum number of samples */
368	<	if (n < i)
367	>	i = 1 + (MINADIV-1)*(ambacc > FTINY);
368	>	if (n < i) /* use minimum number of samples? */
369		n = i;
370		/* allocate sampling array */
371		hp = (AMBHEMI )malloc(sizeof(AMBHEMI) + sizeof(AMBSAMP)(n*n - 1));
372		if (hp == NULL)
373		error(SYSTEM, "out of memory in samp_hemi");
374	+
375	+	if (backside) {
376	+	hp->atyp = TAMBIENT;
377	+	hp->onrm[0] = -r->ron[0];
378	+	hp->onrm[1] = -r->ron[1];
379	+	hp->onrm[2] = -r->ron[2];
380	+	} else {
381	+	hp->atyp = RAMBIENT;
382	+	VCOPY(hp->onrm, r->ron);
383	+	}
384		hp->rp = r;
385		hp->ns = n;
386	<	hp->acol[RED] = hp->acol[GRN] = hp->acol[BLU] = 0.0;
386	>	scolorblack(hp->acol);
387		memset(hp->sa, 0, sizeof(AMBSAMP)nn);
388		hp->sampOK = 0;
389		/* assign coefficient */
390	<	copycolor(hp->acoef, rcol);
390	>	copyscolor(hp->acoef, rcol);
391		d = 1.0/(n*n);
392	<	scalecolor(hp->acoef, d);
392	>	scalescolor(hp->acoef, d);
393		/* make tangent plane axes */
394	<	if (!getperpendicular(hp->ux, r->ron, 1))
394	>	if (!getperpendicular(hp->ux, hp->onrm, 1))
395		error(CONSISTENCY, "bad ray direction in samp_hemi");
396	<	VCROSS(hp->uy, r->ron, hp->ux);
396	>	VCROSS(hp->uy, hp->onrm, hp->ux);
397		/* sample divisions */
398		for (i = hp->ns; i--; )
399		for (j = hp->ns; j--; )
400		hp->sampOK += ambsample(hp, i, j, 0);
401	<	copycolor(rcol, hp->acol);
401	>	copyscolor(rcol, hp->acol);
402		if (!hp->sampOK) { /* utter failure? */
403		free(hp);
404		return(NULL);
#	Line 282 \| Line 407 \| *samp_hemi( / sample indirect hemisphere /*
407		hp->sampOK = -1; / soft failure */
408		return(hp);
409		}
410	+	if (hp->sampOK <= MINADIV*MINADIV)
411	+	return(hp); /* don't bother super-sampling */
412		n = ambssamp*wt + 0.5;
413	<	if (n > 8) { /* perform super-sampling? */
413	>	if (n >= 4hp->ns) { / perform super-sampling? */
414		ambsupersamp(hp, n);
415	<	copycolor(rcol, hp->acol);
415	>	copyscolor(rcol, hp->acol);
416		}
417		return(hp); /* all is well */
418		}
#	Line 297 \| Line 424 \| *back_ambval(AMBHEMI hp, const int n1, const int n2, c**
424		{
425		if (hp->sa[n1].d <= hp->sa[n2].d) {
426		if (hp->sa[n1].d <= hp->sa[n3].d)
427	<	return(colval(hp->sa[n1].v,CIEY));
428	<	return(colval(hp->sa[n3].v,CIEY));
427	>	return(hp->sa[n1].v[0]);
428	>	return(hp->sa[n3].v[0]);
429		}
430		if (hp->sa[n2].d <= hp->sa[n3].d)
431	<	return(colval(hp->sa[n2].v,CIEY));
432	<	return(colval(hp->sa[n3].v,CIEY));
431	>	return(hp->sa[n2].v[0]);
432	>	return(hp->sa[n3].v[0]);
433		}
434
435
#	Line 531 \| Line 658 \| *ambHessian( / anisotropic radii & pos. gradient /*
658		for (j = 0; j < hp->ns-1; j++) {
659		comp_fftri(&fftr, hp, AI(hp,0,j), AI(hp,0,j+1));
660		if (hessrow != NULL)
661	<	comp_hessian(hessrow[j], &fftr, hp->rp->ron);
661	>	comp_hessian(hessrow[j], &fftr, hp->onrm);
662		if (gradrow != NULL)
663	<	comp_gradient(gradrow[j], &fftr, hp->rp->ron);
663	>	comp_gradient(gradrow[j], &fftr, hp->onrm);
664		}
665		/* sum each row of triangles */
666		for (i = 0; i < hp->ns-1; i++) {
#	Line 541 \| Line 668 \| *ambHessian( / anisotropic radii & pos. gradient /*
668		FVECT gradcol;
669		comp_fftri(&fftr, hp, AI(hp,i,0), AI(hp,i+1,0));
670		if (hessrow != NULL)
671	<	comp_hessian(hesscol, &fftr, hp->rp->ron);
671	>	comp_hessian(hesscol, &fftr, hp->onrm);
672		if (gradrow != NULL)
673	<	comp_gradient(gradcol, &fftr, hp->rp->ron);
673	>	comp_gradient(gradcol, &fftr, hp->onrm);
674		for (j = 0; j < hp->ns-1; j++) {
675		FVECT hessdia[3]; /* compute triangle contributions */
676		FVECT graddia;
#	Line 553 \| Line 680 \| *ambHessian( / anisotropic radii & pos. gradient /*
680		/* diagonal (inner) edge */
681		comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j));
682		if (hessrow != NULL) {
683	<	comp_hessian(hessdia, &fftr, hp->rp->ron);
683	>	comp_hessian(hessdia, &fftr, hp->onrm);
684		rev_hessian(hesscol);
685		add2hessian(hessian, hessrow[j], hessdia, hesscol, backg);
686		}
687		if (gradrow != NULL) {
688	<	comp_gradient(graddia, &fftr, hp->rp->ron);
688	>	comp_gradient(graddia, &fftr, hp->onrm);
689		rev_gradient(gradcol);
690		add2gradient(gradient, gradrow[j], graddia, gradcol, backg);
691		}
692		/* initialize edge in next row */
693		comp_fftri(&fftr, hp, AI(hp,i+1,j+1), AI(hp,i+1,j));
694		if (hessrow != NULL)
695	<	comp_hessian(hessrow[j], &fftr, hp->rp->ron);
695	>	comp_hessian(hessrow[j], &fftr, hp->onrm);
696		if (gradrow != NULL)
697	<	comp_gradient(gradrow[j], &fftr, hp->rp->ron);
697	>	comp_gradient(gradrow[j], &fftr, hp->onrm);
698		/* new column edge & paired triangle */
699		backg = back_ambval(hp, AI(hp,i+1,j+1),
700		AI(hp,i+1,j), AI(hp,i,j+1));
701		comp_fftri(&fftr, hp, AI(hp,i,j+1), AI(hp,i+1,j+1));
702		if (hessrow != NULL) {
703	<	comp_hessian(hesscol, &fftr, hp->rp->ron);
703	>	comp_hessian(hesscol, &fftr, hp->onrm);
704		rev_hessian(hessdia);
705		add2hessian(hessian, hessrow[j], hessdia, hesscol, backg);
706		if (i < hp->ns-2)
707		rev_hessian(hessrow[j]);
708		}
709		if (gradrow != NULL) {
710	<	comp_gradient(gradcol, &fftr, hp->rp->ron);
710	>	comp_gradient(gradcol, &fftr, hp->onrm);
711		rev_gradient(graddia);
712		add2gradient(gradient, gradrow[j], graddia, gradcol, backg);
713		if (i < hp->ns-2)
#	Line 616 \| Line 743 \| *ambdirgrad(AMBHEMI hp, FVECT uv[2], float dg[2])**
743		/* use vector for azimuth + 90deg */
744		VSUB(vd, ap->p, hp->rp->rop);
745		/* brightness over cosine factor */
746	<	gfact = colval(ap->v,CIEY) / DOT(hp->rp->ron, vd);
746	>	gfact = ap->v[0] / DOT(hp->onrm, vd);
747		/* sine = proj_radius/vd_length */
748		dgsum[0] -= DOT(uv[1], vd) * gfact;
749		dgsum[1] += DOT(uv[0], vd) * gfact;
#	Line 666 \| Line 793 \| *ambcorral(AMBHEMI hp, FVECT uv[2], const double r0, c**
793		for (a1 = ang-ang_res; a1 <= ang+ang_res; a1 += ang_step)
794		flgs \|= 1L<<(int)(16/PI(a1 + 2.PI*(a1 < 0)));
795		}
669	–	/* add low-angle incident (< 20deg) */
670	–	if (fabs(hp->rp->rod) <= 0.342) {
671	–	u = -DOT(hp->rp->rdir, uv[0]);
672	–	v = -DOT(hp->rp->rdir, uv[1]);
673	–	if ((r0r0uu + r1r1vv) > hp->rp->rot*hp->rp->rot) {
674	–	ang = atan2a(v, u);
675	–	ang += 2.PI(ang < 0);
676	–	ang *= 16/PI;
677	–	if ((ang < .5) \| (ang >= 31.5))
678	–	flgs \|= 0x80000001;
679	–	else
680	–	flgs \|= 3L<<(int)(ang-.5);
681	–	}
682	–	}
796		return(flgs);
797		}
798
799
800		int
801		doambient( /* compute ambient component */
802	<	COLOR rcol, /* input/output color */
802	>	SCOLOR rcol, /* input/output color */
803		RAY *r,
804	<	double wt,
804	>	double wt, /* negative for back side */
805		FVECT uv[2], /* returned (optional) */
806		float ra[2], /* returned (optional) */
807		float pg[2], /* returned (optional) */
#	Line 716 \| Line 829 \| *doambient( / compute ambient component /*
829		return(0);
830
831		if ((ra == NULL) & (pg == NULL) & (dg == NULL) \|\|
832	<	(hp->sampOK < 0) \| (hp->ns < 6)) {
832	>	(hp->sampOK < 0) \| (hp->ns < MINADIV)) {
833		free(hp); /* Hessian not requested/possible */
834		return(-1); /* value-only return value */
835		}
836	<	if ((d = bright(rcol)) > FTINY) { /* normalize Y values */
837	<	d = 0.99(hp->nshp->ns)/d;
836	>	if ((d = scolor_mean(rcol)) > FTINY) {
837	>	d = 0.99(hp->nshp->ns)/d; /* normalize avg. values */
838		K = 0.01;
839		} else { /* or fall back on geometric Hessian */
840		K = 1.0;
#	Line 729 \| Line 842 \| *doambient( / compute ambient component /*
842		dg = NULL;
843		crlp = NULL;
844		}
845	<	ap = hp->sa; /* relative Y channel from here on... */
845	>	ap = hp->sa; /* single channel from here on... */
846		for (i = hp->ns*hp->ns; i--; ap++)
847	<	colval(ap->v,CIEY) = bright(ap->v)*d + K;
847	>	ap->v[0] = scolor_mean(ap->v)*d + K;
848
849		if (uv == NULL) /* make sure we have axis pointers */
850		uv = my_uv;
#	Line 755 \| Line 868 \| *doambient( / compute ambient component /*
868		if (ra[1] < minarad)
869		ra[1] = minarad;
870		}
871	<	ra[0] *= d = 1.0/sqrt(wt);
871	>	ra[0] *= d = 1.0/sqrt(fabs(wt));
872		if ((ra[1] = d) > 2.0ra[0])
873		ra[1] = 2.0*ra[0];
874		if (ra[1] > maxarad) {
#	Line 764 \| Line 877 \| *doambient( / compute ambient component /*
877		ra[0] = maxarad;
878		}
879		/* flag encroached directions */
880	<	if (crlp != NULL)
880	>	if (crlp != NULL) /* XXX doesn't update with changes to ambacc */
881		crlp = ambcorral(hp, uv, ra[0]ambacc, ra[1]*ambacc);
882		if (pg != NULL) { /* cap gradient if necessary */
883		d = pg[0]pg[0]ra[0]ra[0] + pg[1]pg[1]ra[1]ra[1];
#	Line 778 \| Line 891 \| *doambient( / compute ambient component /*
891		free(hp); /* clean up and return */
892		return(1);
893		}
781	–
782	–
783	–	#else /* ! NEWAMB */
784	–
785	–
786	–	void
787	–	inithemi( /* initialize sampling hemisphere */
788	–	AMBHEMI *hp,
789	–	COLOR ac,
790	–	RAY *r,
791	–	double wt
792	–	)
793	–	{
794	–	double d;
795	–	int i;
796	–	/* set number of divisions */
797	–	if (ambacc <= FTINY &&
798	–	wt > (d = 0.8intens(ac)r->rweight/(ambdiv*minweight)))
799	–	wt = d; /* avoid ray termination */
800	–	hp->nt = sqrt(ambdiv * wt / PI) + 0.5;
801	–	i = ambacc > FTINY ? 3 : 1; /* minimum number of samples */
802	–	if (hp->nt < i)
803	–	hp->nt = i;
804	–	hp->np = PI * hp->nt + 0.5;
805	–	/* set number of super-samples */
806	–	hp->ns = ambssamp * wt + 0.5;
807	–	/* assign coefficient */
808	–	copycolor(hp->acoef, ac);
809	–	d = 1.0/(hp->nt*hp->np);
810	–	scalecolor(hp->acoef, d);
811	–	/* make axes */
812	–	VCOPY(hp->uz, r->ron);
813	–	hp->uy[0] = hp->uy[1] = hp->uy[2] = 0.0;
814	–	for (i = 0; i < 3; i++)
815	–	if (hp->uz[i] < 0.6 && hp->uz[i] > -0.6)
816	–	break;
817	–	if (i >= 3)
818	–	error(CONSISTENCY, "bad ray direction in inithemi");
819	–	hp->uy[i] = 1.0;
820	–	fcross(hp->ux, hp->uy, hp->uz);
821	–	normalize(hp->ux);
822	–	fcross(hp->uy, hp->uz, hp->ux);
823	–	}
824	–
825	–
826	–	int
827	–	divsample( /* sample a division */
828	–	AMBSAMP *dp,
829	–	AMBHEMI *h,
830	–	RAY *r
831	–	)
832	–	{
833	–	RAY ar;
834	–	int hlist[3];
835	–	double spt[2];
836	–	double xd, yd, zd;
837	–	double b2;
838	–	double phi;
839	–	int i;
840	–	/* ambient coefficient for weight */
841	–	if (ambacc > FTINY)
842	–	setcolor(ar.rcoef, AVGREFL, AVGREFL, AVGREFL);
843	–	else
844	–	copycolor(ar.rcoef, h->acoef);
845	–	if (rayorigin(&ar, AMBIENT, r, ar.rcoef) < 0)
846	–	return(-1);
847	–	if (ambacc > FTINY) {
848	–	multcolor(ar.rcoef, h->acoef);
849	–	scalecolor(ar.rcoef, 1./AVGREFL);
850	–	}
851	–	hlist[0] = r->rno;
852	–	hlist[1] = dp->t;
853	–	hlist[2] = dp->p;
854	–	multisamp(spt, 2, urand(ilhash(hlist,3)+dp->n));
855	–	zd = sqrt((dp->t + spt[0])/h->nt);
856	–	phi = 2.0PI (dp->p + spt[1])/h->np;
857	–	xd = tcos(phi) * zd;
858	–	yd = tsin(phi) * zd;
859	–	zd = sqrt(1.0 - zd*zd);
860	–	for (i = 0; i < 3; i++)
861	–	ar.rdir[i] = xd*h->ux[i] +
862	–	yd*h->uy[i] +
863	–	zd*h->uz[i];
864	–	checknorm(ar.rdir);
865	–	dimlist[ndims++] = dp->t*h->np + dp->p + 90171;
866	–	rayvalue(&ar);
867	–	ndims--;
868	–	multcolor(ar.rcol, ar.rcoef); /* apply coefficient */
869	–	addcolor(dp->v, ar.rcol);
870	–	/* use rt to improve gradient calc */
871	–	if (ar.rt > FTINY && ar.rt < FHUGE)
872	–	dp->r += 1.0/ar.rt;
873	–	/* (re)initialize error */
874	–	if (dp->n++) {
875	–	b2 = bright(dp->v)/dp->n - bright(ar.rcol);
876	–	b2 = b2b2 + dp->k((dp->n-1)*(dp->n-1));
877	–	dp->k = b2/(dp->n*dp->n);
878	–	} else
879	–	dp->k = 0.0;
880	–	return(0);
881	–	}
882	–
883	–
884	–	static int
885	–	ambcmp( /* decreasing order */
886	–	const void *p1,
887	–	const void *p2
888	–	)
889	–	{
890	–	const AMBSAMP d1 = (const AMBSAMP )p1;
891	–	const AMBSAMP d2 = (const AMBSAMP )p2;
892	–
893	–	if (d1->k < d2->k)
894	–	return(1);
895	–	if (d1->k > d2->k)
896	–	return(-1);
897	–	return(0);
898	–	}
899	–
900	–
901	–	static int
902	–	ambnorm( /* standard order */
903	–	const void *p1,
904	–	const void *p2
905	–	)
906	–	{
907	–	const AMBSAMP d1 = (const AMBSAMP )p1;
908	–	const AMBSAMP d2 = (const AMBSAMP )p2;
909	–	int c;
910	–
911	–	if ( (c = d1->t - d2->t) )
912	–	return(c);
913	–	return(d1->p - d2->p);
914	–	}
915	–
916	–
917	–	double
918	–	doambient( /* compute ambient component */
919	–	COLOR rcol,
920	–	RAY *r,
921	–	double wt,
922	–	FVECT pg,
923	–	FVECT dg
924	–	)
925	–	{
926	–	double b, d=0;
927	–	AMBHEMI hemi;
928	–	AMBSAMP *div;
929	–	AMBSAMP dnew;
930	–	double acol[3];
931	–	AMBSAMP *dp;
932	–	double arad;
933	–	int divcnt;
934	–	int i, j;
935	–	/* initialize hemisphere */
936	–	inithemi(&hemi, rcol, r, wt);
937	–	divcnt = hemi.nt * hemi.np;
938	–	/* initialize */
939	–	if (pg != NULL)
940	–	pg[0] = pg[1] = pg[2] = 0.0;
941	–	if (dg != NULL)
942	–	dg[0] = dg[1] = dg[2] = 0.0;
943	–	setcolor(rcol, 0.0, 0.0, 0.0);
944	–	if (divcnt == 0)
945	–	return(0.0);
946	–	/* allocate super-samples */
947	–	if (hemi.ns > 0 \|\| pg != NULL \|\| dg != NULL) {
948	–	div = (AMBSAMP )malloc(divcntsizeof(AMBSAMP));
949	–	if (div == NULL)
950	–	error(SYSTEM, "out of memory in doambient");
951	–	} else
952	–	div = NULL;
953	–	/* sample the divisions */
954	–	arad = 0.0;
955	–	acol[0] = acol[1] = acol[2] = 0.0;
956	–	if ((dp = div) == NULL)
957	–	dp = &dnew;
958	–	divcnt = 0;
959	–	for (i = 0; i < hemi.nt; i++)
960	–	for (j = 0; j < hemi.np; j++) {
961	–	dp->t = i; dp->p = j;
962	–	setcolor(dp->v, 0.0, 0.0, 0.0);
963	–	dp->r = 0.0;
964	–	dp->n = 0;
965	–	if (divsample(dp, &hemi, r) < 0) {
966	–	if (div != NULL)
967	–	dp++;
968	–	continue;
969	–	}
970	–	arad += dp->r;
971	–	divcnt++;
972	–	if (div != NULL)
973	–	dp++;
974	–	else
975	–	addcolor(acol, dp->v);
976	–	}
977	–	if (!divcnt) {
978	–	if (div != NULL)
979	–	free((void *)div);
980	–	return(0.0); /* no samples taken */
981	–	}
982	–	if (divcnt < hemi.nt*hemi.np) {
983	–	pg = dg = NULL; /* incomplete sampling */
984	–	hemi.ns = 0;
985	–	} else if (arad > FTINY && divcnt/arad < minarad) {
986	–	hemi.ns = 0; /* close enough */
987	–	} else if (hemi.ns > 0) { /* else perform super-sampling? */
988	–	comperrs(div, &hemi); /* compute errors */
989	–	qsort(div, divcnt, sizeof(AMBSAMP), ambcmp); /* sort divs */
990	–	/* super-sample */
991	–	for (i = hemi.ns; i > 0; i--) {
992	–	dnew = *div;
993	–	if (divsample(&dnew, &hemi, r) < 0) {
994	–	dp++;
995	–	continue;
996	–	}
997	–	dp = div; /* reinsert */
998	–	j = divcnt < i ? divcnt : i;
999	–	while (--j > 0 && dnew.k < dp[1].k) {
1000	–	dp = (dp+1);
1001	–	dp++;
1002	–	}
1003	–	*dp = dnew;
1004	–	}
1005	–	if (pg != NULL \|\| dg != NULL) /* restore order */
1006	–	qsort(div, divcnt, sizeof(AMBSAMP), ambnorm);
1007	–	}
1008	–	/* compute returned values */
1009	–	if (div != NULL) {
1010	–	arad = 0.0; /* note: divcnt may be < ntnp /
1011	–	for (i = hemi.nt*hemi.np, dp = div; i-- > 0; dp++) {
1012	–	arad += dp->r;
1013	–	if (dp->n > 1) {
1014	–	b = 1.0/dp->n;
1015	–	scalecolor(dp->v, b);
1016	–	dp->r *= b;
1017	–	dp->n = 1;
1018	–	}
1019	–	addcolor(acol, dp->v);
1020	–	}
1021	–	b = bright(acol);
1022	–	if (b > FTINY) {
1023	–	b = 1.0/b; /* compute & normalize gradient(s) */
1024	–	if (pg != NULL) {
1025	–	posgradient(pg, div, &hemi);
1026	–	for (i = 0; i < 3; i++)
1027	–	pg[i] *= b;
1028	–	}
1029	–	if (dg != NULL) {
1030	–	dirgradient(dg, div, &hemi);
1031	–	for (i = 0; i < 3; i++)
1032	–	dg[i] *= b;
1033	–	}
1034	–	}
1035	–	free((void *)div);
1036	–	}
1037	–	copycolor(rcol, acol);
1038	–	if (arad <= FTINY)
1039	–	arad = maxarad;
1040	–	else
1041	–	arad = (divcnt+hemi.ns)/arad;
1042	–	if (pg != NULL) { /* reduce radius if gradient large */
1043	–	d = DOT(pg,pg);
1044	–	if (daradarad > 1.0)
1045	–	arad = 1.0/sqrt(d);
1046	–	}
1047	–	if (arad < minarad) {
1048	–	arad = minarad;
1049	–	if (pg != NULL && daradarad > 1.0) { /* cap gradient */
1050	–	d = 1.0/arad/sqrt(d);
1051	–	for (i = 0; i < 3; i++)
1052	–	pg[i] *= d;
1053	–	}
1054	–	}
1055	–	if ((arad /= sqrt(wt)) > maxarad)
1056	–	arad = maxarad;
1057	–	return(arad);
1058	–	}
1059	–
1060	–
1061	–	void
1062	–	comperrs( /* compute initial error estimates */
1063	–	AMBSAMP da, / assumes standard ordering */
1064	–	AMBHEMI *hp
1065	–	)
1066	–	{
1067	–	double b, b2;
1068	–	int i, j;
1069	–	AMBSAMP *dp;
1070	–	/* sum differences from neighbors */
1071	–	dp = da;
1072	–	for (i = 0; i < hp->nt; i++)
1073	–	for (j = 0; j < hp->np; j++) {
1074	–	#ifdef DEBUG
1075	–	if (dp->t != i \|\| dp->p != j)
1076	–	error(CONSISTENCY,
1077	–	"division order in comperrs");
1078	–	#endif
1079	–	b = bright(dp[0].v);
1080	–	if (i > 0) { /* from above */
1081	–	b2 = bright(dp[-hp->np].v) - b;
1082	–	b2 = b2 0.25;
1083	–	dp[0].k += b2;
1084	–	dp[-hp->np].k += b2;
1085	–	}
1086	–	if (j > 0) { /* from behind */
1087	–	b2 = bright(dp[-1].v) - b;
1088	–	b2 = b2 0.25;
1089	–	dp[0].k += b2;
1090	–	dp[-1].k += b2;
1091	–	} else { /* around */
1092	–	b2 = bright(dp[hp->np-1].v) - b;
1093	–	b2 = b2 0.25;
1094	–	dp[0].k += b2;
1095	–	dp[hp->np-1].k += b2;
1096	–	}
1097	–	dp++;
1098	–	}
1099	–	/* divide by number of neighbors */
1100	–	dp = da;
1101	–	for (j = 0; j < hp->np; j++) /* top row */
1102	–	(dp++)->k *= 1.0/3.0;
1103	–	if (hp->nt < 2)
1104	–	return;
1105	–	for (i = 1; i < hp->nt-1; i++) /* central region */
1106	–	for (j = 0; j < hp->np; j++)
1107	–	(dp++)->k *= 0.25;
1108	–	for (j = 0; j < hp->np; j++) /* bottom row */
1109	–	(dp++)->k *= 1.0/3.0;
1110	–	}
1111	–
1112	–
1113	–	void
1114	–	posgradient( /* compute position gradient */
1115	–	FVECT gv,
1116	–	AMBSAMP da, / assumes standard ordering */
1117	–	AMBHEMI *hp
1118	–	)
1119	–	{
1120	–	int i, j;
1121	–	double nextsine, lastsine, b, d;
1122	–	double mag0, mag1;
1123	–	double phi, cosp, sinp, xd, yd;
1124	–	AMBSAMP *dp;
1125	–
1126	–	xd = yd = 0.0;
1127	–	for (j = 0; j < hp->np; j++) {
1128	–	dp = da + j;
1129	–	mag0 = mag1 = 0.0;
1130	–	lastsine = 0.0;
1131	–	for (i = 0; i < hp->nt; i++) {
1132	–	#ifdef DEBUG
1133	–	if (dp->t != i \|\| dp->p != j)
1134	–	error(CONSISTENCY,
1135	–	"division order in posgradient");
1136	–	#endif
1137	–	b = bright(dp->v);
1138	–	if (i > 0) {
1139	–	d = dp[-hp->np].r;
1140	–	if (dp[0].r > d) d = dp[0].r;
1141	–	/* sin(t)cos(t)^2 /
1142	–	d = lastsine (1.0 - (double)i/hp->nt);
1143	–	mag0 += d*(b - bright(dp[-hp->np].v));
1144	–	}
1145	–	nextsine = sqrt((double)(i+1)/hp->nt);
1146	–	if (j > 0) {
1147	–	d = dp[-1].r;
1148	–	if (dp[0].r > d) d = dp[0].r;
1149	–	mag1 += d * (nextsine - lastsine) *
1150	–	(b - bright(dp[-1].v));
1151	–	} else {
1152	–	d = dp[hp->np-1].r;
1153	–	if (dp[0].r > d) d = dp[0].r;
1154	–	mag1 += d * (nextsine - lastsine) *
1155	–	(b - bright(dp[hp->np-1].v));
1156	–	}
1157	–	dp += hp->np;
1158	–	lastsine = nextsine;
1159	–	}
1160	–	mag0 = 2.0PI / hp->np;
1161	–	phi = 2.0PI (double)j/hp->np;
1162	–	cosp = tcos(phi); sinp = tsin(phi);
1163	–	xd += mag0cosp - mag1sinp;
1164	–	yd += mag0sinp + mag1cosp;
1165	–	}
1166	–	for (i = 0; i < 3; i++)
1167	–	gv[i] = (xdhp->ux[i] + ydhp->uy[i])(hp->nthp->np)/PI;
1168	–	}
1169	–
1170	–
1171	–	void
1172	–	dirgradient( /* compute direction gradient */
1173	–	FVECT gv,
1174	–	AMBSAMP da, / assumes standard ordering */
1175	–	AMBHEMI *hp
1176	–	)
1177	–	{
1178	–	int i, j;
1179	–	double mag;
1180	–	double phi, xd, yd;
1181	–	AMBSAMP *dp;
1182	–
1183	–	xd = yd = 0.0;
1184	–	for (j = 0; j < hp->np; j++) {
1185	–	dp = da + j;
1186	–	mag = 0.0;
1187	–	for (i = 0; i < hp->nt; i++) {
1188	–	#ifdef DEBUG
1189	–	if (dp->t != i \|\| dp->p != j)
1190	–	error(CONSISTENCY,
1191	–	"division order in dirgradient");
1192	–	#endif
1193	–	/* tan(t) */
1194	–	mag += bright(dp->v)/sqrt(hp->nt/(i+.5) - 1.0);
1195	–	dp += hp->np;
1196	–	}
1197	–	phi = 2.0PI (j+.5)/hp->np + PI/2.0;
1198	–	xd += mag * tcos(phi);
1199	–	yd += mag * tsin(phi);
1200	–	}
1201	–	for (i = 0; i < 3; i++)
1202	–	gv[i] = xdhp->ux[i] + ydhp->uy[i];
1203	–	}
1204	–
1205	–	#endif /* ! NEWAMB */

Diff Legend

-–
+Removed lines
-+
+Added lines
-<
+Changed lines
->
+Changed lines

Comparing ray/src/rt/ambcomp.c (file contents): Revision 2.73 by greg, Fri Oct 14 00:54:21 2016 UTC vs. Revision 2.101 by greg, Tue Apr 29 23:41:10 2025 UTC

Diff Legend

Comparing ray/src/rt/ambcomp.c (file contents):
Revision 2.73 by greg, Fri Oct 14 00:54:21 2016 UTC vs.
Revision 2.101 by greg, Tue Apr 29 23:41:10 2025 UTC