151 |
|
in_mesh(MIGRATION *miga[3], unsigned char *emap, int nedges, |
152 |
|
const FVECT ivec, MIGRATION *mig) |
153 |
|
{ |
154 |
< |
MIGRATION *ej1, *ej2; |
155 |
< |
RBFNODE *tv; |
154 |
> |
RBFNODE *tv[2]; |
155 |
> |
MIGRATION *sej[2], *dej[2]; |
156 |
> |
int i; |
157 |
|
/* check visitation record */ |
158 |
|
if (!check_edge(emap, nedges, mig, 1)) |
159 |
|
return(0); |
161 |
|
miga[0] = mig; /* close enough to edge */ |
162 |
|
return(1); |
163 |
|
} |
164 |
< |
/* do triangles either side */ |
165 |
< |
for (ej1 = mig->rbfv[0]->ejl; ej1 != NULL; |
166 |
< |
ej1 = nextedge(mig->rbfv[0],ej1)) { |
167 |
< |
if (ej1 == mig) |
168 |
< |
continue; |
169 |
< |
tv = opp_rbf(mig->rbfv[0],ej1); |
170 |
< |
for (ej2 = tv->ejl; ej2 != NULL; ej2 = nextedge(tv,ej2)) |
171 |
< |
if (opp_rbf(tv,ej2) == mig->rbfv[1]) { |
172 |
< |
int do_ej1 = check_edge(emap, nedges, ej1, 0); |
173 |
< |
int do_ej2 = check_edge(emap, nedges, ej2, 0); |
174 |
< |
if (do_ej1 && in_mesh(miga, emap, nedges, ivec, ej1)) |
175 |
< |
return(1); |
176 |
< |
if (do_ej2 && in_mesh(miga, emap, nedges, ivec, ej2)) |
177 |
< |
return(1); |
178 |
< |
/* check just once */ |
178 |
< |
if (do_ej1 & do_ej2 && in_tri(mig->rbfv[0], |
179 |
< |
mig->rbfv[1], tv, ivec)) { |
180 |
< |
miga[0] = mig; |
181 |
< |
miga[1] = ej1; |
182 |
< |
miga[2] = ej2; |
183 |
< |
return(1); |
164 |
> |
if (!get_triangles(tv, mig)) /* do triangles either side? */ |
165 |
> |
return(0); |
166 |
> |
for (i = 2; i--; ) { /* identify edges to check */ |
167 |
> |
MIGRATION *ej; |
168 |
> |
sej[i] = dej[i] = NULL; |
169 |
> |
if (tv[i] == NULL) |
170 |
> |
continue; |
171 |
> |
for (ej = tv[i]->ejl; ej != NULL; ej = nextedge(tv[i],ej)) { |
172 |
> |
RBFNODE *rbfop = opp_rbf(tv[i],ej); |
173 |
> |
if (rbfop == mig->rbfv[0]) { |
174 |
> |
if (check_edge(emap, nedges, ej, 0)) |
175 |
> |
sej[i] = ej; |
176 |
> |
} else if (rbfop == mig->rbfv[1]) { |
177 |
> |
if (check_edge(emap, nedges, ej, 0)) |
178 |
> |
dej[i] = ej; |
179 |
|
} |
180 |
|
} |
181 |
|
} |
182 |
+ |
for (i = 2; i--; ) { /* check triangles just once */ |
183 |
+ |
if (sej[i] != NULL && in_mesh(miga, emap, nedges, ivec, sej[i])) |
184 |
+ |
return(1); |
185 |
+ |
if (dej[i] != NULL && in_mesh(miga, emap, nedges, ivec, dej[i])) |
186 |
+ |
return(1); |
187 |
+ |
if ((sej[i] == NULL) | (dej[i] == NULL)) |
188 |
+ |
continue; |
189 |
+ |
if (in_tri(mig->rbfv[0], mig->rbfv[1], tv[i], ivec)) { |
190 |
+ |
miga[0] = mig; |
191 |
+ |
miga[1] = sej[i]; |
192 |
+ |
miga[2] = dej[i]; |
193 |
+ |
return(1); |
194 |
+ |
} |
195 |
+ |
} |
196 |
|
return(0); /* not near this edge */ |
197 |
|
} |
198 |
|
|
202 |
|
{ |
203 |
|
miga[0] = miga[1] = miga[2] = NULL; |
204 |
|
if (single_plane_incident) { /* isotropic BSDF? */ |
205 |
< |
RBFNODE *rbf; /* find edge we're on */ |
206 |
< |
for (rbf = dsf_list; rbf != NULL; rbf = rbf->next) { |
207 |
< |
if (input_orient*rbf->invec[2] < input_orient*invec[2]) |
208 |
< |
break; |
209 |
< |
if (rbf->next != NULL && |
201 |
< |
input_orient*rbf->next->invec[2] < |
205 |
> |
RBFNODE *rbf; /* find edge we're on */ |
206 |
> |
for (rbf = dsf_list; rbf != NULL; rbf = rbf->next) { |
207 |
> |
if (input_orient*rbf->invec[2] < input_orient*invec[2]) |
208 |
> |
break; |
209 |
> |
if (rbf->next != NULL && input_orient*rbf->next->invec[2] < |
210 |
|
input_orient*invec[2]) { |
211 |
< |
for (miga[0] = rbf->ejl; miga[0] != NULL; |
212 |
< |
miga[0] = nextedge(rbf,miga[0])) |
213 |
< |
if (opp_rbf(rbf,miga[0]) == rbf->next) { |
214 |
< |
double nf = 1.-rbf->invec[2]*rbf->invec[2]; |
215 |
< |
if (nf > FTINY) { |
216 |
< |
nf = sqrt((1.-invec[2]*invec[2])/nf); |
217 |
< |
invec[0] = nf*rbf->invec[0]; |
218 |
< |
invec[1] = nf*rbf->invec[1]; |
219 |
< |
} |
220 |
< |
return(0); |
213 |
< |
} |
214 |
< |
break; |
211 |
> |
for (miga[0] = rbf->ejl; miga[0] != NULL; |
212 |
> |
miga[0] = nextedge(rbf,miga[0])) |
213 |
> |
if (opp_rbf(rbf,miga[0]) == rbf->next) { |
214 |
> |
double nf = 1. - rbf->invec[2]*rbf->invec[2]; |
215 |
> |
if (nf > FTINY) { /* rotate to match */ |
216 |
> |
nf = sqrt((1.-invec[2]*invec[2])/nf); |
217 |
> |
invec[0] = nf*rbf->invec[0]; |
218 |
> |
invec[1] = nf*rbf->invec[1]; |
219 |
> |
} |
220 |
> |
return(0); |
221 |
|
} |
222 |
+ |
break; |
223 |
|
} |
224 |
< |
return(-1); /* outside range! */ |
224 |
> |
} |
225 |
> |
return(-1); /* outside range! */ |
226 |
|
} |
227 |
|
{ /* else use triangle mesh */ |
228 |
|
int sym = use_symmetry(invec); |
239 |
|
exit(1); |
240 |
|
} |
241 |
|
/* identify intersection */ |
242 |
< |
if (!in_mesh(miga, emap, nedges, invec, mig_list)) |
242 |
> |
if (!in_mesh(miga, emap, nedges, invec, mig_list)) { |
243 |
> |
#ifdef DEBUG |
244 |
> |
fprintf(stderr, |
245 |
> |
"Incident angle (%.1f,%.1f) deg. outside mesh\n", |
246 |
> |
get_theta180(invec), get_phi360(invec)); |
247 |
> |
#endif |
248 |
|
sym = -1; /* outside mesh */ |
249 |
< |
else if (miga[1] != NULL && |
249 |
> |
} else if (miga[1] != NULL && |
250 |
|
(miga[2] == NULL || !order_triangle(miga))) { |
251 |
|
#ifdef DEBUG |
252 |
|
fputs("Munged triangle in get_interp()\n", stderr); |
260 |
|
|
261 |
|
/* Advect and allocate new RBF along edge */ |
262 |
|
static RBFNODE * |
263 |
< |
e_advect_rbf(const MIGRATION *mig, const FVECT invec) |
263 |
> |
e_advect_rbf(const MIGRATION *mig, const FVECT invec, int lobe_lim) |
264 |
|
{ |
265 |
+ |
double cthresh = FTINY; |
266 |
|
RBFNODE *rbf; |
267 |
|
int n, i, j; |
268 |
|
double t, full_dist; |
269 |
|
/* get relative position */ |
270 |
< |
t = acos(DOT(invec, mig->rbfv[0]->invec)); |
270 |
> |
t = Acos(DOT(invec, mig->rbfv[0]->invec)); |
271 |
|
if (t < M_PI/grid_res) { /* near first DSF */ |
272 |
|
n = sizeof(RBFNODE) + sizeof(RBFVAL)*(mig->rbfv[0]->nrbf-1); |
273 |
|
rbf = (RBFNODE *)malloc(n); |
274 |
|
if (rbf == NULL) |
275 |
|
goto memerr; |
276 |
|
memcpy(rbf, mig->rbfv[0], n); /* just duplicate */ |
277 |
+ |
rbf->next = NULL; rbf->ejl = NULL; |
278 |
|
return(rbf); |
279 |
|
} |
280 |
|
full_dist = acos(DOT(mig->rbfv[0]->invec, mig->rbfv[1]->invec)); |
284 |
|
if (rbf == NULL) |
285 |
|
goto memerr; |
286 |
|
memcpy(rbf, mig->rbfv[1], n); /* just duplicate */ |
287 |
+ |
rbf->next = NULL; rbf->ejl = NULL; |
288 |
|
return(rbf); |
289 |
|
} |
290 |
< |
t /= full_dist; |
290 |
> |
t /= full_dist; |
291 |
> |
tryagain: |
292 |
|
n = 0; /* count migrating particles */ |
293 |
|
for (i = 0; i < mtx_nrows(mig); i++) |
294 |
|
for (j = 0; j < mtx_ncols(mig); j++) |
295 |
< |
n += (mtx_coef(mig,i,j) > FTINY); |
295 |
> |
n += (mtx_coef(mig,i,j) > cthresh); |
296 |
> |
/* are we over our limit? */ |
297 |
> |
if ((lobe_lim > 0) & (n > lobe_lim)) { |
298 |
> |
cthresh = cthresh*2. + 10.*FTINY; |
299 |
> |
goto tryagain; |
300 |
> |
} |
301 |
|
#ifdef DEBUG |
302 |
|
fprintf(stderr, "Input RBFs have %d, %d nodes -> output has %d\n", |
303 |
|
mig->rbfv[0]->nrbf, mig->rbfv[1]->nrbf, n); |
318 |
|
float mv; |
319 |
|
ovec_from_pos(v0, rbf0i->gx, rbf0i->gy); |
320 |
|
for (j = 0; j < mtx_ncols(mig); j++) |
321 |
< |
if ((mv = mtx_coef(mig,i,j)) > FTINY) { |
321 |
> |
if ((mv = mtx_coef(mig,i,j)) > cthresh) { |
322 |
|
const RBFVAL *rbf1j = &mig->rbfv[1]->rbfa[j]; |
323 |
|
double rad1 = R2ANG(rbf1j->crad); |
324 |
|
FVECT v; |
327 |
|
rbf->rbfa[n].crad = ANG2R(sqrt(rad0*rad0*(1.-t) + |
328 |
|
rad1*rad1*t)); |
329 |
|
ovec_from_pos(v, rbf1j->gx, rbf1j->gy); |
330 |
< |
geodesic(v, v0, v, t*full_dist, GEOD_RAD); |
330 |
> |
geodesic(v, v0, v, t, GEOD_REL); |
331 |
|
pos_from_vec(pos, v); |
332 |
|
rbf->rbfa[n].gx = pos[0]; |
333 |
|
rbf->rbfa[n].gy = pos[1]; |
344 |
|
|
345 |
|
/* Partially advect between recorded incident angles and allocate new RBF */ |
346 |
|
RBFNODE * |
347 |
< |
advect_rbf(const FVECT invec) |
347 |
> |
advect_rbf(const FVECT invec, int lobe_lim) |
348 |
|
{ |
349 |
+ |
double cthresh = FTINY; |
350 |
|
FVECT sivec; |
351 |
|
MIGRATION *miga[3]; |
352 |
|
RBFNODE *rbf; |
354 |
|
float mbfact, mcfact; |
355 |
|
int n, i, j, k; |
356 |
|
FVECT v0, v1, v2; |
357 |
< |
double s, t, s_full, t_full; |
357 |
> |
double s, t; |
358 |
|
|
359 |
|
VCOPY(sivec, invec); /* find triangle/edge */ |
360 |
|
sym = get_interp(miga, sivec); |
361 |
|
if (sym < 0) /* can't interpolate? */ |
362 |
|
return(NULL); |
363 |
|
if (miga[1] == NULL) { /* advect along edge? */ |
364 |
< |
rbf = e_advect_rbf(miga[0], sivec); |
364 |
> |
rbf = e_advect_rbf(miga[0], sivec, lobe_lim); |
365 |
|
if (single_plane_incident) |
366 |
|
rotate_rbf(rbf, invec); |
367 |
|
else |
383 |
|
normalize(v2); |
384 |
|
fcross(v1, sivec, miga[1]->rbfv[1]->invec); |
385 |
|
normalize(v1); |
386 |
< |
s = acos(DOT(v0,v1)); |
386 |
> |
s = acos(DOT(v0,v1)) / acos(DOT(v0,v2)); |
387 |
|
geodesic(v1, miga[0]->rbfv[0]->invec, miga[0]->rbfv[1]->invec, |
388 |
< |
s, GEOD_RAD); |
389 |
< |
s /= s_full = acos(DOT(v0,v2)); |
390 |
< |
t = acos(DOT(v1,sivec)) / |
368 |
< |
(t_full = acos(DOT(v1,miga[1]->rbfv[1]->invec))); |
388 |
> |
s, GEOD_REL); |
389 |
> |
t = acos(DOT(v1,sivec)) / acos(DOT(v1,miga[1]->rbfv[1]->invec)); |
390 |
> |
tryagain: |
391 |
|
n = 0; /* count migrating particles */ |
392 |
|
for (i = 0; i < mtx_nrows(miga[0]); i++) |
393 |
|
for (j = 0; j < mtx_ncols(miga[0]); j++) |
394 |
< |
for (k = (mtx_coef(miga[0],i,j) > FTINY) * |
394 |
> |
for (k = (mtx_coef(miga[0],i,j) > cthresh) * |
395 |
|
mtx_ncols(miga[2]); k--; ) |
396 |
< |
n += (mtx_coef(miga[2],i,k) > FTINY || |
397 |
< |
mtx_coef(miga[1],j,k) > FTINY); |
396 |
> |
n += (mtx_coef(miga[2],i,k) > cthresh || |
397 |
> |
mtx_coef(miga[1],j,k) > cthresh); |
398 |
> |
/* are we over our limit? */ |
399 |
> |
if ((lobe_lim > 0) & (n > lobe_lim)) { |
400 |
> |
cthresh = cthresh*2. + 10.*FTINY; |
401 |
> |
goto tryagain; |
402 |
> |
} |
403 |
|
#ifdef DEBUG |
404 |
|
fprintf(stderr, "Input RBFs have %d, %d, %d nodes -> output has %d\n", |
405 |
|
miga[0]->rbfv[0]->nrbf, miga[0]->rbfv[1]->nrbf, |
427 |
|
const float ma = mtx_coef(miga[0],i,j); |
428 |
|
const RBFVAL *rbf1j; |
429 |
|
double rad1j, srad2; |
430 |
< |
if (ma <= FTINY) |
430 |
> |
if (ma <= cthresh) |
431 |
|
continue; |
432 |
|
rbf1j = &miga[0]->rbfv[1]->rbfa[j]; |
433 |
|
rad1j = R2ANG(rbf1j->crad); |
434 |
|
srad2 = (1.-s)*(1.-t)*rad0i*rad0i + s*(1.-t)*rad1j*rad1j; |
435 |
|
ovec_from_pos(v1, rbf1j->gx, rbf1j->gy); |
436 |
< |
geodesic(v1, v0, v1, s*s_full, GEOD_RAD); |
436 |
> |
geodesic(v1, v0, v1, s, GEOD_REL); |
437 |
|
for (k = 0; k < mtx_ncols(miga[2]); k++) { |
438 |
|
float mb = mtx_coef(miga[1],j,k); |
439 |
|
float mc = mtx_coef(miga[2],i,k); |
440 |
|
const RBFVAL *rbf2k; |
441 |
|
double rad2k; |
415 |
– |
FVECT vout; |
442 |
|
int pos[2]; |
443 |
< |
if ((mb <= FTINY) & (mc <= FTINY)) |
443 |
> |
if ((mb <= cthresh) & (mc <= cthresh)) |
444 |
|
continue; |
445 |
|
rbf2k = &miga[2]->rbfv[1]->rbfa[k]; |
446 |
|
rbf->rbfa[n].peak = w0i * ma * (mb*mbfact + mc*mcfact); |
447 |
|
rad2k = R2ANG(rbf2k->crad); |
448 |
|
rbf->rbfa[n].crad = ANG2R(sqrt(srad2 + t*rad2k*rad2k)); |
449 |
|
ovec_from_pos(v2, rbf2k->gx, rbf2k->gy); |
450 |
< |
geodesic(vout, v1, v2, t*t_full, GEOD_RAD); |
451 |
< |
pos_from_vec(pos, vout); |
450 |
> |
geodesic(v2, v1, v2, t, GEOD_REL); |
451 |
> |
pos_from_vec(pos, v2); |
452 |
|
rbf->rbfa[n].gx = pos[0]; |
453 |
|
rbf->rbfa[n].gy = pos[1]; |
454 |
|
++n; |