| 12 |
|
#include "view.h" |
| 13 |
|
|
| 14 |
|
#ifndef DEPS |
| 15 |
< |
#define DEPS 0.01 /* depth epsilon */ |
| 15 |
> |
#define DEPS 0.02 /* depth epsilon */ |
| 16 |
|
#endif |
| 17 |
+ |
#ifndef PEPS |
| 18 |
+ |
#define PEPS 0.04 /* pixel value epsilon */ |
| 19 |
+ |
#endif |
| 20 |
|
#ifndef MAXRAD |
| 21 |
|
#define MAXRAD 64 /* maximum kernel radius */ |
| 22 |
|
#endif |
| 42 |
|
|
| 43 |
|
static int4 *pixFlags; /* pixel occupancy flags */ |
| 44 |
|
static float pixWeight[MAXRAD2]; /* pixel weighting function */ |
| 45 |
+ |
static short isqrttab[MAXRAD2]; /* integer square root table */ |
| 46 |
|
|
| 47 |
+ |
#define isqrt(i2) ((int)isqrttab[(int)(i2)]) |
| 48 |
+ |
|
| 49 |
|
extern VIEW myview; /* current output view */ |
| 50 |
|
extern COLOR *mypixel; /* pixels being rendered */ |
| 51 |
|
extern float *myweight; /* weights (used to compute final pixels) */ |
| 113 |
|
int |
| 114 |
|
kill_occl(h, v, nl, n) /* check for occlusion errors */ |
| 115 |
|
int h, v; |
| 116 |
< |
short nl[NNEIGH][2]; |
| 116 |
> |
register short nl[NNEIGH][2]; |
| 117 |
|
int n; |
| 118 |
|
{ |
| 119 |
|
short forequad[2][2]; |
| 120 |
|
int d; |
| 121 |
< |
register int4 i; |
| 121 |
> |
register int4 i, p; |
| 122 |
|
|
| 123 |
|
if (n <= 0) |
| 124 |
|
return(1); |
| 125 |
+ |
p = v*hres + h; |
| 126 |
|
forequad[0][0] = forequad[0][1] = forequad[1][0] = forequad[1][1] = 0; |
| 127 |
|
for (i = n; i--; ) { |
| 128 |
|
d = (h-nl[i][0])*(h-nl[i][0]) + (v-nl[i][1])*(v-nl[i][1]); |
| 129 |
< |
if (mydepth[nl[i][1]*hres+nl[i][0]] < |
| 130 |
< |
mydepth[v*hres+h]*(1.-DEPS*d)) |
| 129 |
> |
d = isqrt(d); |
| 130 |
> |
if (mydepth[nl[i][1]*hres+nl[i][0]]*(1.+DEPS*d) < mydepth[p]) |
| 131 |
|
forequad[nl[i][0]<h][nl[i][1]<v] = 1; |
| 132 |
|
} |
| 133 |
< |
if (forequad[0][0]+forequad[0][1]+forequad[1][0]+forequad[1][1] > 1) { |
| 134 |
< |
i = v*hres + h; |
| 135 |
< |
setcolor(mypixel[i], 0., 0., 0.); |
| 129 |
< |
myweight[i] = 0.; /* occupancy reset afterwards */ |
| 133 |
> |
if (forequad[0][0]+forequad[0][1]+forequad[1][0]+forequad[1][1] > 2) { |
| 134 |
> |
setcolor(mypixel[p], 0., 0., 0.); |
| 135 |
> |
myweight[p] = 0.; /* occupancy reset afterwards */ |
| 136 |
|
} |
| 137 |
|
return(1); |
| 138 |
|
} |
| 144 |
|
register short nl[NNEIGH][2]; |
| 145 |
|
int n; |
| 146 |
|
{ |
| 147 |
+ |
int dis[NNEIGH], ndis; |
| 148 |
|
COLOR mykern[MAXRAD2]; |
| 142 |
– |
float mykw[MAXRAD2]; |
| 149 |
|
int4 maxr2; |
| 150 |
< |
double w; |
| 150 |
> |
double w, d; |
| 151 |
|
register int4 p, r2; |
| 152 |
< |
int maxr, h2, v2; |
| 152 |
> |
int i, r, maxr, h2, v2; |
| 153 |
|
|
| 154 |
|
if (n <= 0) |
| 155 |
|
return(1); |
| 156 |
|
p = v*hres + h; /* build kernel values */ |
| 157 |
|
maxr2 = (h-nl[n-1][0])*(h-nl[n-1][0]) + (v-nl[n-1][1])*(v-nl[n-1][1]); |
| 158 |
|
DCHECK(maxr2>=MAXRAD2, CONSISTENCY, "out of range neighbor"); |
| 159 |
< |
for (r2 = maxr2+1; --r2; ) { |
| 160 |
< |
copycolor(mykern[r2], mypixel[p]); |
| 161 |
< |
mykw[r2] = pixWeight[r2]; |
| 162 |
< |
if (2*r2 >= maxr2) /* soften skirt */ |
| 163 |
< |
mykw[r2] *= (2*(maxr2-r2)+1.0)/maxr2; |
| 164 |
< |
scalecolor(mykern[r2], mykw[r2]); |
| 159 |
> |
maxr = isqrt(maxr2); |
| 160 |
> |
for (v2 = 1; v2 <= maxr; v2++) |
| 161 |
> |
for (h2 = 0; h2 <= v2; h2++) { |
| 162 |
> |
r2 = h2*h2 + v2*v2; |
| 163 |
> |
if (r2 > maxr2) break; |
| 164 |
> |
copycolor(mykern[r2], mypixel[p]); |
| 165 |
> |
scalecolor(mykern[r2], pixWeight[r2]); |
| 166 |
> |
} |
| 167 |
> |
ndis = 0; /* find discontinuities */ |
| 168 |
> |
for (i = n; i--; ) { |
| 169 |
> |
r2 = (h-nl[i][0])*(h-nl[i][0]) + (v-nl[i][1])*(v-nl[i][1]); |
| 170 |
> |
r = isqrt(r2); |
| 171 |
> |
d = mydepth[nl[i][1]*hres+nl[i][0]] / mydepth[p]; |
| 172 |
> |
d = d>=1. ? d-1. : 1.-d; |
| 173 |
> |
if (d > r*DEPS || bigdiff(mypixel[p], |
| 174 |
> |
mypixel[nl[i][1]*hres+nl[i][0]], r*PEPS)) |
| 175 |
> |
dis[ndis++] = i; |
| 176 |
|
} |
| 177 |
< |
maxr = sqrt((double)maxr2) + .99; /* stamp out that kernel */ |
| 177 |
> |
/* stamp out that kernel */ |
| 178 |
|
for (v2 = v-maxr; v2 <= v+maxr; v2++) { |
| 179 |
< |
if (v2 < 0) continue; |
| 180 |
< |
if (v2 >= vres) break; |
| 179 |
> |
if (v2 < 0) v2 = 0; |
| 180 |
> |
else if (v2 >= vres) break; |
| 181 |
|
for (h2 = h-maxr; h2 <= h+maxr; h2++) { |
| 182 |
< |
if (h2 < 0) continue; |
| 183 |
< |
if (h2 >= hres) break; |
| 184 |
< |
r2 = (v2-v)*(v2-v) + (h2-h)*(h2-h); |
| 182 |
> |
if (h2 < 0) h2 = 0; |
| 183 |
> |
else if (h2 >= hres) break; |
| 184 |
> |
r2 = (h2-h)*(h2-h) + (v2-v)*(v2-v); |
| 185 |
|
if (r2 > maxr2) continue; |
| 186 |
|
if (CHK4(pixFlags, v2*hres+h2)) |
| 187 |
|
continue; /* occupied */ |
| 188 |
+ |
for (i = ndis; i--; ) { |
| 189 |
+ |
r = (h2-nl[dis[i]][0])*(h2-nl[dis[i]][0]) + |
| 190 |
+ |
(v2-nl[dis[i]][1])*(v2-nl[dis[i]][1]); |
| 191 |
+ |
if (r < r2) break; |
| 192 |
+ |
} |
| 193 |
+ |
if (i >= 0) continue; /* outside edge */ |
| 194 |
|
addcolor(mypixel[v2*hres+h2], mykern[r2]); |
| 195 |
< |
myweight[v2*hres+h2] += mykw[r2]*myweight[v*hres+h]; |
| 195 |
> |
myweight[v2*hres+h2] += pixWeight[r2] * |
| 196 |
> |
myweight[v*hres+h]; |
| 197 |
|
} |
| 198 |
|
} |
| 199 |
|
return(1); |
| 206 |
|
meet_neighbors(kill_occl); /* eliminate occlusion errors */ |
| 207 |
|
reset_flags(); /* reset occupancy flags */ |
| 208 |
|
if (pixWeight[0] <= FTINY) { /* initialize weighting function */ |
| 209 |
< |
register int r; |
| 210 |
< |
for (r = MAXRAD2; --r; ) |
| 211 |
< |
pixWeight[r] = G0NORM/sqrt((double)r); |
| 209 |
> |
register int i, j, r2; |
| 210 |
> |
double d; |
| 211 |
> |
for (i = 1; i <= MAXRAD; i++) |
| 212 |
> |
for (j = 0; j <= i; j++) { |
| 213 |
> |
r2 = i*i + j*j; |
| 214 |
> |
if (r2 >= MAXRAD2) break; |
| 215 |
> |
d = sqrt((double)r2); |
| 216 |
> |
pixWeight[r2] = G0NORM/d; |
| 217 |
> |
isqrttab[r2] = d + 0.99; |
| 218 |
> |
} |
| 219 |
|
pixWeight[0] = 1.; |
| 220 |
+ |
isqrttab[0] = 0; |
| 221 |
|
} |
| 222 |
|
meet_neighbors(grow_samp); /* grow valid samples over image */ |
| 223 |
|
free((char *)pixFlags); /* free pixel flags */ |
| 247 |
|
register short (*rnl)[NNEIGH]; |
| 248 |
|
{ |
| 249 |
|
int nn = 0; |
| 250 |
< |
int4 d, ld, nd[NNEIGH+1]; |
| 250 |
> |
int4 d, nd[NNEIGH]; |
| 251 |
|
int n, hoff; |
| 252 |
|
register int h2, n2; |
| 253 |
|
|
| 254 |
< |
ld = MAXRAD2; |
| 254 |
> |
nd[NNEIGH-1] = MAXRAD2; |
| 255 |
|
for (hoff = 1; hoff < hres; hoff = (hoff<0) - hoff) { |
| 256 |
|
h2 = h + hoff; |
| 257 |
|
if (h2 < 0 | h2 >= hres) |
| 258 |
|
continue; |
| 259 |
< |
if ((h2-h)*(h2-h) >= ld) |
| 259 |
> |
if ((h2-h)*(h2-h) >= nd[NNEIGH-1]) |
| 260 |
|
break; |
| 261 |
|
for (n = 0; n < NNEIGH && rnl[h2][n] < NINF; n++) { |
| 262 |
|
d = (h2-h)*(h2-h) + (v-rnl[h2][n])*(v-rnl[h2][n]); |
| 263 |
< |
if (d >= ld) |
| 263 |
> |
if (d >= nd[NNEIGH-1]) |
| 264 |
|
continue; |
| 265 |
< |
for (n2 = nn; ; n2--) { /* insert neighbor */ |
| 265 |
> |
if (nn < NNEIGH) /* insert neighbor */ |
| 266 |
> |
nn++; |
| 267 |
> |
for (n2 = nn; n2--; ) { |
| 268 |
|
if (!n2 || d >= nd[n2-1]) { |
| 269 |
|
nd[n2] = d; |
| 270 |
|
nl[n2][0] = h2; |
| 275 |
|
nl[n2][0] = nl[n2-1][0]; |
| 276 |
|
nl[n2][1] = nl[n2-1][1]; |
| 277 |
|
} |
| 244 |
– |
if (nn < NNEIGH) |
| 245 |
– |
nn++; |
| 246 |
– |
else |
| 247 |
– |
ld = nd[NNEIGH-1]; |
| 278 |
|
} |
| 279 |
|
} |
| 280 |
|
return(nn); |
