51 |
|
insert_vert(vert, miga[i]->rbfv[1]); |
52 |
|
} |
53 |
|
/* should be just 3 vertices */ |
54 |
< |
if ((vert[3] == NULL) | (vert[4] != NULL)) |
54 |
> |
if ((vert[2] == NULL) | (vert[3] != NULL)) |
55 |
|
return(0); |
56 |
|
/* identify edge 0 */ |
57 |
|
for (i = 3; i--; ) |
85 |
|
return(1); |
86 |
|
} |
87 |
|
|
88 |
< |
/* Determine if we are close enough to the given edge */ |
88 |
> |
/* Determine if we are close enough to an edge */ |
89 |
|
static int |
90 |
|
on_edge(const MIGRATION *ej, const FVECT ivec) |
91 |
|
{ |
92 |
< |
double cos_a = DOT(ej->rbfv[0]->invec, ivec); |
93 |
< |
double cos_b = DOT(ej->rbfv[1]->invec, ivec); |
94 |
< |
double cos_c = DOT(ej->rbfv[0]->invec, ej->rbfv[1]->invec); |
95 |
< |
double cos_aplusb = cos_a*cos_b - |
96 |
< |
sqrt((1.-cos_a*cos_a)*(1.-cos_b*cos_b)); |
92 |
> |
double cos_a, cos_b, cos_c, cos_aplusb; |
93 |
> |
/* use triangle inequality */ |
94 |
> |
cos_a = DOT(ej->rbfv[0]->invec, ivec); |
95 |
> |
if (cos_a <= 0) |
96 |
> |
return(0); |
97 |
|
|
98 |
< |
return(cos_aplusb - cos_c < .01); |
98 |
> |
cos_b = DOT(ej->rbfv[1]->invec, ivec); |
99 |
> |
if (cos_b <= 0) |
100 |
> |
return(0); |
101 |
> |
|
102 |
> |
cos_aplusb = cos_a*cos_b - sqrt((1.-cos_a*cos_a)*(1.-cos_b*cos_b)); |
103 |
> |
if (cos_aplusb <= 0) |
104 |
> |
return(0); |
105 |
> |
|
106 |
> |
cos_c = DOT(ej->rbfv[0]->invec, ej->rbfv[1]->invec); |
107 |
> |
|
108 |
> |
return(cos_c - cos_aplusb < .001); |
109 |
|
} |
110 |
|
|
111 |
|
/* Determine if we are inside the given triangle */ |
126 |
|
return(sgn2 == sgn3); |
127 |
|
} |
128 |
|
|
129 |
+ |
/* Test (and set) bitmap for edge */ |
130 |
+ |
static int |
131 |
+ |
check_edge(unsigned char *emap, int nedges, const MIGRATION *mig, int mark) |
132 |
+ |
{ |
133 |
+ |
int ejndx, bit2check; |
134 |
+ |
|
135 |
+ |
if (mig->rbfv[0]->ord > mig->rbfv[1]->ord) |
136 |
+ |
ejndx = mig->rbfv[1]->ord + (nedges-1)*mig->rbfv[0]->ord; |
137 |
+ |
else |
138 |
+ |
ejndx = mig->rbfv[0]->ord + (nedges-1)*mig->rbfv[1]->ord; |
139 |
+ |
|
140 |
+ |
bit2check = 1<<(ejndx&07); |
141 |
+ |
|
142 |
+ |
if (emap[ejndx>>3] & bit2check) |
143 |
+ |
return(0); |
144 |
+ |
if (mark) |
145 |
+ |
emap[ejndx>>3] |= bit2check; |
146 |
+ |
return(1); |
147 |
+ |
} |
148 |
+ |
|
149 |
|
/* Compute intersection with the given position over remaining mesh */ |
150 |
|
static int |
151 |
|
in_mesh(MIGRATION *miga[3], unsigned char *emap, int nedges, |
153 |
|
{ |
154 |
|
MIGRATION *ej1, *ej2; |
155 |
|
RBFNODE *tv; |
126 |
– |
int ejndx; |
156 |
|
/* check visitation record */ |
157 |
< |
if (mig->rbfv[0]->ord > mig->rbfv[1]->ord) |
129 |
< |
ejndx = mig->rbfv[1]->ord + (nedges-1)*mig->rbfv[0]->ord; |
130 |
< |
else |
131 |
< |
ejndx = mig->rbfv[0]->ord + (nedges-1)*mig->rbfv[1]->ord; |
132 |
< |
if (emap[ejndx>>3] & 1<<(ejndx&07)) /* tested already? */ |
157 |
> |
if (!check_edge(emap, nedges, mig, 1)) |
158 |
|
return(0); |
134 |
– |
emap[ejndx>>3] |= 1<<(ejndx&07); /* else mark & test it */ |
159 |
|
if (on_edge(mig, ivec)) { |
160 |
|
miga[0] = mig; /* close enough to edge */ |
161 |
|
return(1); |
163 |
|
/* do triangles either side */ |
164 |
|
for (ej1 = mig->rbfv[0]->ejl; ej1 != NULL; |
165 |
|
ej1 = nextedge(mig->rbfv[0],ej1)) { |
166 |
< |
if (ej1 == mig) |
167 |
< |
continue; |
168 |
< |
tv = opp_rbf(mig->rbfv[0],ej1); |
169 |
< |
for (ej2 = tv->ejl; ej2 != NULL; ej2 = nextedge(tv,ej2)) |
170 |
< |
if (opp_rbf(tv,ej2) == mig->rbfv[1]) { |
171 |
< |
if (in_mesh(miga, emap, nedges, ivec, ej1)) |
172 |
< |
return(1); |
173 |
< |
if (in_mesh(miga, emap, nedges, ivec, ej2)) |
174 |
< |
return(1); |
175 |
< |
if (in_tri(mig->rbfv[0], mig->rbfv[1], |
176 |
< |
tv, ivec)) { |
177 |
< |
miga[0] = mig; |
178 |
< |
miga[1] = ej1; |
179 |
< |
miga[2] = ej2; |
180 |
< |
return(1); |
181 |
< |
} |
166 |
> |
if (ej1 == mig) |
167 |
> |
continue; |
168 |
> |
tv = opp_rbf(mig->rbfv[0],ej1); |
169 |
> |
for (ej2 = tv->ejl; ej2 != NULL; ej2 = nextedge(tv,ej2)) |
170 |
> |
if (opp_rbf(tv,ej2) == mig->rbfv[1]) { |
171 |
> |
int do_ej1 = check_edge(emap, nedges, ej1, 0); |
172 |
> |
int do_ej2 = check_edge(emap, nedges, ej2, 0); |
173 |
> |
if (do_ej1 && in_mesh(miga, emap, nedges, ivec, ej1)) |
174 |
> |
return(1); |
175 |
> |
if (do_ej2 && in_mesh(miga, emap, nedges, ivec, ej2)) |
176 |
> |
return(1); |
177 |
> |
/* 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); |
184 |
|
} |
185 |
+ |
} |
186 |
|
} |
187 |
< |
return(0); |
187 |
> |
return(0); /* not near this edge */ |
188 |
|
} |
189 |
|
|
190 |
|
/* Find edge(s) for interpolating the given vector, applying symmetry */ |
202 |
|
input_orient*invec[2]) { |
203 |
|
for (miga[0] = rbf->ejl; miga[0] != NULL; |
204 |
|
miga[0] = nextedge(rbf,miga[0])) |
205 |
< |
if (opp_rbf(rbf,miga[0]) == rbf->next) |
205 |
> |
if (opp_rbf(rbf,miga[0]) == rbf->next) { |
206 |
> |
double nf = 1.-rbf->invec[2]*rbf->invec[2]; |
207 |
> |
if (nf > FTINY) { |
208 |
> |
nf = sqrt((1.-invec[2]*invec[2])/nf); |
209 |
> |
invec[0] = nf*rbf->invec[0]; |
210 |
> |
invec[1] = nf*rbf->invec[1]; |
211 |
> |
} |
212 |
|
return(0); |
213 |
+ |
} |
214 |
|
break; |
215 |
|
} |
216 |
|
} |
254 |
|
double t, full_dist; |
255 |
|
/* get relative position */ |
256 |
|
t = acos(DOT(invec, mig->rbfv[0]->invec)); |
257 |
< |
if (t < M_PI/GRIDRES) { /* near first DSF */ |
257 |
> |
if (t < M_PI/grid_res) { /* near first DSF */ |
258 |
|
n = sizeof(RBFNODE) + sizeof(RBFVAL)*(mig->rbfv[0]->nrbf-1); |
259 |
|
rbf = (RBFNODE *)malloc(n); |
260 |
|
if (rbf == NULL) |
263 |
|
return(rbf); |
264 |
|
} |
265 |
|
full_dist = acos(DOT(mig->rbfv[0]->invec, mig->rbfv[1]->invec)); |
266 |
< |
if (t > full_dist-M_PI/GRIDRES) { /* near second DSF */ |
266 |
> |
if (t > full_dist-M_PI/grid_res) { /* near second DSF */ |
267 |
|
n = sizeof(RBFNODE) + sizeof(RBFVAL)*(mig->rbfv[1]->nrbf-1); |
268 |
|
rbf = (RBFNODE *)malloc(n); |
269 |
|
if (rbf == NULL) |
305 |
|
rbf->rbfa[n].crad = ANG2R(sqrt(rad0*rad0*(1.-t) + |
306 |
|
rad1*rad1*t)); |
307 |
|
ovec_from_pos(v, rbf1j->gx, rbf1j->gy); |
308 |
< |
geodesic(v, v0, v, t, GEOD_REL); |
308 |
> |
geodesic(v, v0, v, t*full_dist, GEOD_RAD); |
309 |
|
pos_from_vec(pos, v); |
310 |
|
rbf->rbfa[n].gx = pos[0]; |
311 |
|
rbf->rbfa[n].gy = pos[1]; |
331 |
|
float mbfact, mcfact; |
332 |
|
int n, i, j, k; |
333 |
|
FVECT v0, v1, v2; |
334 |
< |
double s, t; |
334 |
> |
double s, t, s_full, t_full; |
335 |
|
|
336 |
|
VCOPY(sivec, invec); /* find triangle/edge */ |
337 |
|
sym = get_interp(miga, sivec); |
339 |
|
return(NULL); |
340 |
|
if (miga[1] == NULL) { /* advect along edge? */ |
341 |
|
rbf = e_advect_rbf(miga[0], sivec); |
342 |
< |
rev_rbf_symmetry(rbf, sym); |
342 |
> |
if (single_plane_incident) |
343 |
> |
rotate_rbf(rbf, invec); |
344 |
> |
else |
345 |
> |
rev_rbf_symmetry(rbf, sym); |
346 |
|
return(rbf); |
347 |
|
} |
348 |
|
#ifdef DEBUG |
360 |
|
normalize(v2); |
361 |
|
fcross(v1, sivec, miga[1]->rbfv[1]->invec); |
362 |
|
normalize(v1); |
363 |
< |
s = acos(DOT(v0,v1)) / acos(DOT(v0,v2)); |
363 |
> |
s = acos(DOT(v0,v1)); |
364 |
|
geodesic(v1, miga[0]->rbfv[0]->invec, miga[0]->rbfv[1]->invec, |
365 |
< |
s, GEOD_REL); |
366 |
< |
t = acos(DOT(v1,sivec)) / acos(DOT(v1,miga[1]->rbfv[1]->invec)); |
365 |
> |
s, GEOD_RAD); |
366 |
> |
s /= s_full = acos(DOT(v0,v2)); |
367 |
> |
t = acos(DOT(v1,sivec)) / |
368 |
> |
(t_full = acos(DOT(v1,miga[1]->rbfv[1]->invec))); |
369 |
|
n = 0; /* count migrating particles */ |
370 |
|
for (i = 0; i < mtx_nrows(miga[0]); i++) |
371 |
|
for (j = 0; j < mtx_ncols(miga[0]); j++) |
372 |
|
for (k = (mtx_coef(miga[0],i,j) > FTINY) * |
373 |
|
mtx_ncols(miga[2]); k--; ) |
374 |
< |
n += (mtx_coef(miga[2],i,k) > FTINY && |
374 |
> |
n += (mtx_coef(miga[2],i,k) > FTINY || |
375 |
|
mtx_coef(miga[1],j,k) > FTINY); |
376 |
|
#ifdef DEBUG |
377 |
|
fprintf(stderr, "Input RBFs have %d, %d, %d nodes -> output has %d\n", |
406 |
|
rad1j = R2ANG(rbf1j->crad); |
407 |
|
srad2 = (1.-s)*(1.-t)*rad0i*rad0i + s*(1.-t)*rad1j*rad1j; |
408 |
|
ovec_from_pos(v1, rbf1j->gx, rbf1j->gy); |
409 |
< |
geodesic(v1, v0, v1, s, GEOD_REL); |
409 |
> |
geodesic(v1, v0, v1, s*s_full, GEOD_RAD); |
410 |
|
for (k = 0; k < mtx_ncols(miga[2]); k++) { |
411 |
|
float mb = mtx_coef(miga[1],j,k); |
412 |
|
float mc = mtx_coef(miga[2],i,k); |
414 |
|
double rad2k; |
415 |
|
FVECT vout; |
416 |
|
int pos[2]; |
417 |
< |
if ((mb <= FTINY) | (mc <= FTINY)) |
417 |
> |
if ((mb <= FTINY) & (mc <= FTINY)) |
418 |
|
continue; |
419 |
|
rbf2k = &miga[2]->rbfv[1]->rbfa[k]; |
420 |
|
rbf->rbfa[n].peak = w0i * ma * (mb*mbfact + mc*mcfact); |
421 |
|
rad2k = R2ANG(rbf2k->crad); |
422 |
|
rbf->rbfa[n].crad = ANG2R(sqrt(srad2 + t*rad2k*rad2k)); |
423 |
|
ovec_from_pos(v2, rbf2k->gx, rbf2k->gy); |
424 |
< |
geodesic(vout, v1, v2, t, GEOD_REL); |
424 |
> |
geodesic(vout, v1, v2, t*t_full, GEOD_RAD); |
425 |
|
pos_from_vec(pos, vout); |
426 |
|
rbf->rbfa[n].gx = pos[0]; |
427 |
|
rbf->rbfa[n].gy = pos[1]; |