ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/Development/ray/src/rt/ambcomp.c

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

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines (old)
>	Changed lines (new)