13 |
|
#include <string.h> |
14 |
|
#include <math.h> |
15 |
|
#include "bsdfrep.h" |
16 |
– |
/* migration edges drawn in raster fashion */ |
17 |
– |
MIGRATION *mig_grid[GRIDRES][GRIDRES]; |
16 |
|
|
19 |
– |
#ifdef DEBUG |
20 |
– |
#include "random.h" |
21 |
– |
#include "bmpfile.h" |
22 |
– |
/* Hash pointer to byte value (must return 0 for NULL) */ |
23 |
– |
static int |
24 |
– |
byte_hash(const void *p) |
25 |
– |
{ |
26 |
– |
size_t h = (size_t)p; |
27 |
– |
h ^= (size_t)p >> 8; |
28 |
– |
h ^= (size_t)p >> 16; |
29 |
– |
h ^= (size_t)p >> 24; |
30 |
– |
return(h & 0xff); |
31 |
– |
} |
32 |
– |
/* Write out BMP image showing edges */ |
33 |
– |
static void |
34 |
– |
write_edge_image(const char *fname) |
35 |
– |
{ |
36 |
– |
BMPHeader *hdr = BMPmappedHeader(GRIDRES, GRIDRES, 0, 256); |
37 |
– |
BMPWriter *wtr; |
38 |
– |
int i, j; |
39 |
– |
|
40 |
– |
fprintf(stderr, "Writing incident mesh drawing to '%s'\n", fname); |
41 |
– |
hdr->compr = BI_RLE8; |
42 |
– |
for (i = 256; --i; ) { /* assign random color map */ |
43 |
– |
hdr->palette[i].r = random() & 0xff; |
44 |
– |
hdr->palette[i].g = random() & 0xff; |
45 |
– |
hdr->palette[i].b = random() & 0xff; |
46 |
– |
/* reject dark colors */ |
47 |
– |
i += (hdr->palette[i].r + hdr->palette[i].g + |
48 |
– |
hdr->palette[i].b < 128); |
49 |
– |
} |
50 |
– |
hdr->palette[0].r = hdr->palette[0].g = hdr->palette[0].b = 0; |
51 |
– |
/* open output */ |
52 |
– |
wtr = BMPopenOutputFile(fname, hdr); |
53 |
– |
if (wtr == NULL) { |
54 |
– |
free(hdr); |
55 |
– |
return; |
56 |
– |
} |
57 |
– |
for (i = 0; i < GRIDRES; i++) { /* write scanlines */ |
58 |
– |
for (j = 0; j < GRIDRES; j++) |
59 |
– |
wtr->scanline[j] = byte_hash(mig_grid[i][j]); |
60 |
– |
if (BMPwriteScanline(wtr) != BIR_OK) |
61 |
– |
break; |
62 |
– |
} |
63 |
– |
BMPcloseOutput(wtr); /* close & clean up */ |
64 |
– |
} |
65 |
– |
#endif |
66 |
– |
|
67 |
– |
/* Draw edge list into mig_grid array */ |
68 |
– |
void |
69 |
– |
draw_edges(void) |
70 |
– |
{ |
71 |
– |
int nnull = 0, ntot = 0; |
72 |
– |
MIGRATION *ej; |
73 |
– |
int p0[2], p1[2]; |
74 |
– |
|
75 |
– |
memset(mig_grid, 0, sizeof(mig_grid)); |
76 |
– |
for (ej = mig_list; ej != NULL; ej = ej->next) { |
77 |
– |
++ntot; |
78 |
– |
pos_from_vec(p0, ej->rbfv[0]->invec); |
79 |
– |
pos_from_vec(p1, ej->rbfv[1]->invec); |
80 |
– |
if ((p0[0] == p1[0]) & (p0[1] == p1[1])) { |
81 |
– |
++nnull; |
82 |
– |
mig_grid[p0[0]][p0[1]] = ej; |
83 |
– |
continue; |
84 |
– |
} |
85 |
– |
if (abs(p1[0]-p0[0]) > abs(p1[1]-p0[1])) { |
86 |
– |
const int xstep = 2*(p1[0] > p0[0]) - 1; |
87 |
– |
const double ystep = (double)((p1[1]-p0[1])*xstep) / |
88 |
– |
(double)(p1[0]-p0[0]); |
89 |
– |
int x; |
90 |
– |
double y; |
91 |
– |
for (x = p0[0], y = p0[1]+.5; x != p1[0]; |
92 |
– |
x += xstep, y += ystep) |
93 |
– |
mig_grid[x][(int)y] = ej; |
94 |
– |
mig_grid[x][(int)y] = ej; |
95 |
– |
} else { |
96 |
– |
const int ystep = 2*(p1[1] > p0[1]) - 1; |
97 |
– |
const double xstep = (double)((p1[0]-p0[0])*ystep) / |
98 |
– |
(double)(p1[1]-p0[1]); |
99 |
– |
int y; |
100 |
– |
double x; |
101 |
– |
for (y = p0[1], x = p0[0]+.5; y != p1[1]; |
102 |
– |
y += ystep, x += xstep) |
103 |
– |
mig_grid[(int)x][y] = ej; |
104 |
– |
mig_grid[(int)x][y] = ej; |
105 |
– |
} |
106 |
– |
} |
107 |
– |
if (nnull) |
108 |
– |
fprintf(stderr, "Warning: %d of %d edges are null\n", |
109 |
– |
nnull, ntot); |
110 |
– |
#ifdef DEBUG |
111 |
– |
write_edge_image("bsdf_edges.bmp"); |
112 |
– |
#endif |
113 |
– |
} |
114 |
– |
|
115 |
– |
/* Identify enclosing triangle for this position (flood fill raster check) */ |
116 |
– |
static int |
117 |
– |
identify_tri(MIGRATION *miga[3], unsigned char vmap[GRIDRES][(GRIDRES+7)/8], |
118 |
– |
int px, int py) |
119 |
– |
{ |
120 |
– |
const int btest = 1<<(py&07); |
121 |
– |
|
122 |
– |
if (vmap[px][py>>3] & btest) /* already visited here? */ |
123 |
– |
return(1); |
124 |
– |
/* else mark it */ |
125 |
– |
vmap[px][py>>3] |= btest; |
126 |
– |
|
127 |
– |
if (mig_grid[px][py] != NULL) { /* are we on an edge? */ |
128 |
– |
int i; |
129 |
– |
for (i = 0; i < 3; i++) { |
130 |
– |
if (miga[i] == mig_grid[px][py]) |
131 |
– |
return(1); |
132 |
– |
if (miga[i] != NULL) |
133 |
– |
continue; |
134 |
– |
miga[i] = mig_grid[px][py]; |
135 |
– |
return(1); |
136 |
– |
} |
137 |
– |
return(0); /* outside triangle! */ |
138 |
– |
} |
139 |
– |
/* check neighbors (flood) */ |
140 |
– |
if (px > 0 && !identify_tri(miga, vmap, px-1, py)) |
141 |
– |
return(0); |
142 |
– |
if (px < GRIDRES-1 && !identify_tri(miga, vmap, px+1, py)) |
143 |
– |
return(0); |
144 |
– |
if (py > 0 && !identify_tri(miga, vmap, px, py-1)) |
145 |
– |
return(0); |
146 |
– |
if (py < GRIDRES-1 && !identify_tri(miga, vmap, px, py+1)) |
147 |
– |
return(0); |
148 |
– |
return(1); /* this neighborhood done */ |
149 |
– |
} |
150 |
– |
|
17 |
|
/* Insert vertex in ordered list */ |
18 |
|
static void |
19 |
|
insert_vert(RBFNODE **vlist, RBFNODE *v) |
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 an edge */ |
89 |
+ |
static int |
90 |
+ |
on_edge(const MIGRATION *ej, const FVECT ivec) |
91 |
+ |
{ |
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 |
+ |
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 */ |
112 |
+ |
static int |
113 |
+ |
in_tri(const RBFNODE *v1, const RBFNODE *v2, const RBFNODE *v3, const FVECT p) |
114 |
+ |
{ |
115 |
+ |
FVECT vc; |
116 |
+ |
int sgn1, sgn2, sgn3; |
117 |
+ |
/* signed volume test */ |
118 |
+ |
VCROSS(vc, v1->invec, v2->invec); |
119 |
+ |
sgn1 = (DOT(p, vc) > 0); |
120 |
+ |
VCROSS(vc, v2->invec, v3->invec); |
121 |
+ |
sgn2 = (DOT(p, vc) > 0); |
122 |
+ |
if (sgn1 != sgn2) |
123 |
+ |
return(0); |
124 |
+ |
VCROSS(vc, v3->invec, v1->invec); |
125 |
+ |
sgn3 = (DOT(p, vc) > 0); |
126 |
+ |
return(sgn2 == sgn3); |
127 |
+ |
} |
128 |
+ |
|
129 |
+ |
/* Test and set 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, |
152 |
+ |
const FVECT ivec, MIGRATION *mig) |
153 |
+ |
{ |
154 |
+ |
MIGRATION *ej1, *ej2; |
155 |
+ |
RBFNODE *tv; |
156 |
+ |
/* check visitation record */ |
157 |
+ |
if (!check_edge(emap, nedges, mig, 1)) |
158 |
+ |
return(0); |
159 |
+ |
if (on_edge(mig, ivec)) { |
160 |
+ |
miga[0] = mig; /* close enough to edge */ |
161 |
+ |
return(1); |
162 |
+ |
} |
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 |
+ |
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); /* not near this edge */ |
188 |
+ |
} |
189 |
+ |
|
190 |
|
/* Find edge(s) for interpolating the given vector, applying symmetry */ |
191 |
|
int |
192 |
|
get_interp(MIGRATION *miga[3], FVECT invec) |
210 |
|
return(-1); /* outside range! */ |
211 |
|
} |
212 |
|
{ /* else use triangle mesh */ |
213 |
< |
const int sym = use_symmetry(invec); |
214 |
< |
unsigned char floodmap[GRIDRES][(GRIDRES+7)/8]; |
215 |
< |
int pstart[2]; |
216 |
< |
RBFNODE *vother; |
217 |
< |
MIGRATION *ej; |
218 |
< |
int i; |
219 |
< |
|
220 |
< |
pos_from_vec(pstart, invec); |
221 |
< |
memset(floodmap, 0, sizeof(floodmap)); |
222 |
< |
/* call flooding function */ |
223 |
< |
if (!identify_tri(miga, floodmap, pstart[0], pstart[1])) |
224 |
< |
return(-1); /* outside mesh */ |
225 |
< |
if ((miga[0] == NULL) | (miga[2] == NULL)) |
226 |
< |
return(-1); /* should never happen */ |
227 |
< |
if (miga[1] == NULL) |
228 |
< |
return(sym); /* on edge */ |
229 |
< |
/* verify triangle */ |
230 |
< |
if (!order_triangle(miga)) { |
213 |
> |
int sym = use_symmetry(invec); |
214 |
> |
int nedges = 0; |
215 |
> |
MIGRATION *mep; |
216 |
> |
unsigned char *emap; |
217 |
> |
/* clear visitation map */ |
218 |
> |
for (mep = mig_list; mep != NULL; mep = mep->next) |
219 |
> |
++nedges; |
220 |
> |
emap = (unsigned char *)calloc((nedges*(nedges-1) + 7)>>3, 1); |
221 |
> |
if (emap == NULL) { |
222 |
> |
fprintf(stderr, "%s: Out of memory in get_interp()\n", |
223 |
> |
progname); |
224 |
> |
exit(1); |
225 |
> |
} |
226 |
> |
/* identify intersection */ |
227 |
> |
if (!in_mesh(miga, emap, nedges, invec, mig_list)) |
228 |
> |
sym = -1; /* outside mesh */ |
229 |
> |
else if (miga[1] != NULL && |
230 |
> |
(miga[2] == NULL || !order_triangle(miga))) { |
231 |
|
#ifdef DEBUG |
232 |
|
fputs("Munged triangle in get_interp()\n", stderr); |
233 |
|
#endif |
234 |
< |
vother = NULL; /* find triangle from edge */ |
267 |
< |
for (i = 3; i--; ) { |
268 |
< |
RBFNODE *tpair[2]; |
269 |
< |
if (get_triangles(tpair, miga[i]) && |
270 |
< |
(vother = tpair[ is_rev_tri( |
271 |
< |
miga[i]->rbfv[0]->invec, |
272 |
< |
miga[i]->rbfv[1]->invec, |
273 |
< |
invec) ]) != NULL) |
274 |
< |
break; |
275 |
< |
} |
276 |
< |
if (vother == NULL) { /* couldn't find 3rd vertex */ |
277 |
< |
#ifdef DEBUG |
278 |
< |
fputs("No triangle in get_interp()\n", stderr); |
279 |
< |
#endif |
280 |
< |
return(-1); |
281 |
< |
} |
282 |
< |
/* reassign other two edges */ |
283 |
< |
for (ej = vother->ejl; ej != NULL; |
284 |
< |
ej = nextedge(vother,ej)) { |
285 |
< |
RBFNODE *vorig = opp_rbf(vother,ej); |
286 |
< |
if (vorig == miga[i]->rbfv[0]) |
287 |
< |
miga[(i+1)%3] = ej; |
288 |
< |
else if (vorig == miga[i]->rbfv[1]) |
289 |
< |
miga[(i+2)%3] = ej; |
290 |
< |
} |
291 |
< |
if (!order_triangle(miga)) { |
292 |
< |
#ifdef DEBUG |
293 |
< |
fputs("Bad triangle in get_interp()\n", stderr); |
294 |
< |
#endif |
295 |
< |
return(-1); |
296 |
< |
} |
234 |
> |
sym = -1; |
235 |
|
} |
236 |
+ |
free(emap); |
237 |
|
return(sym); /* return in standard order */ |
238 |
|
} |
239 |
|
} |
268 |
|
n = 0; /* count migrating particles */ |
269 |
|
for (i = 0; i < mtx_nrows(mig); i++) |
270 |
|
for (j = 0; j < mtx_ncols(mig); j++) |
271 |
< |
n += (mig->mtx[mtx_ndx(mig,i,j)] > FTINY); |
271 |
> |
n += (mtx_coef(mig,i,j) > FTINY); |
272 |
|
#ifdef DEBUG |
273 |
|
fprintf(stderr, "Input RBFs have %d, %d nodes -> output has %d\n", |
274 |
|
mig->rbfv[0]->nrbf, mig->rbfv[1]->nrbf, n); |
289 |
|
float mv; |
290 |
|
ovec_from_pos(v0, rbf0i->gx, rbf0i->gy); |
291 |
|
for (j = 0; j < mtx_ncols(mig); j++) |
292 |
< |
if ((mv = mig->mtx[mtx_ndx(mig,i,j)]) > FTINY) { |
292 |
> |
if ((mv = mtx_coef(mig,i,j)) > FTINY) { |
293 |
|
const RBFVAL *rbf1j = &mig->rbfv[1]->rbfa[j]; |
294 |
|
double rad1 = R2ANG(rbf1j->crad); |
295 |
|
FVECT v; |
357 |
|
n = 0; /* count migrating particles */ |
358 |
|
for (i = 0; i < mtx_nrows(miga[0]); i++) |
359 |
|
for (j = 0; j < mtx_ncols(miga[0]); j++) |
360 |
< |
for (k = (miga[0]->mtx[mtx_ndx(miga[0],i,j)] > FTINY) * |
360 |
> |
for (k = (mtx_coef(miga[0],i,j) > FTINY) * |
361 |
|
mtx_ncols(miga[2]); k--; ) |
362 |
< |
n += (miga[2]->mtx[mtx_ndx(miga[2],i,k)] > FTINY && |
363 |
< |
miga[1]->mtx[mtx_ndx(miga[1],j,k)] > FTINY); |
362 |
> |
n += (mtx_coef(miga[2],i,k) > FTINY || |
363 |
> |
mtx_coef(miga[1],j,k) > FTINY); |
364 |
|
#ifdef DEBUG |
365 |
|
fprintf(stderr, "Input RBFs have %d, %d, %d nodes -> output has %d\n", |
366 |
|
miga[0]->rbfv[0]->nrbf, miga[0]->rbfv[1]->nrbf, |
385 |
|
const double rad0i = R2ANG(rbf0i->crad); |
386 |
|
ovec_from_pos(v0, rbf0i->gx, rbf0i->gy); |
387 |
|
for (j = 0; j < mtx_ncols(miga[0]); j++) { |
388 |
< |
const float ma = miga[0]->mtx[mtx_ndx(miga[0],i,j)]; |
388 |
> |
const float ma = mtx_coef(miga[0],i,j); |
389 |
|
const RBFVAL *rbf1j; |
390 |
|
double rad1j, srad2; |
391 |
|
if (ma <= FTINY) |
396 |
|
ovec_from_pos(v1, rbf1j->gx, rbf1j->gy); |
397 |
|
geodesic(v1, v0, v1, s, GEOD_REL); |
398 |
|
for (k = 0; k < mtx_ncols(miga[2]); k++) { |
399 |
< |
float mb = miga[1]->mtx[mtx_ndx(miga[1],j,k)]; |
400 |
< |
float mc = miga[2]->mtx[mtx_ndx(miga[2],i,k)]; |
399 |
> |
float mb = mtx_coef(miga[1],j,k); |
400 |
> |
float mc = mtx_coef(miga[2],i,k); |
401 |
|
const RBFVAL *rbf2k; |
402 |
|
double rad2k; |
403 |
|
FVECT vout; |
404 |
|
int pos[2]; |
405 |
< |
if ((mb <= FTINY) | (mc <= FTINY)) |
405 |
> |
if ((mb <= FTINY) & (mc <= FTINY)) |
406 |
|
continue; |
407 |
|
rbf2k = &miga[2]->rbfv[1]->rbfa[k]; |
408 |
|
rbf->rbfa[n].peak = w0i * ma * (mb*mbfact + mc*mcfact); |