1 |
– |
/* Copyright (c) 1999 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Rendering routines for rhpict. |
6 |
|
*/ |
7 |
|
|
8 |
+ |
#include <string.h> |
9 |
+ |
|
10 |
|
#include "holo.h" |
11 |
|
#include "view.h" |
12 |
|
#include "random.h" |
21 |
|
#define MAXRAD 64 /* maximum kernel radius */ |
22 |
|
#endif |
23 |
|
#ifndef NNEIGH |
24 |
< |
#define NNEIGH 7 /* find this many neighbors */ |
24 |
> |
#define NNEIGH 5 /* find this many neighbors */ |
25 |
|
#endif |
26 |
|
|
27 |
|
#define NINF 16382 |
37 |
|
#define CLR4(f,i) FL4OP(f,i,&=~) |
38 |
|
#define TGL4(f,i) FL4OP(f,i,^=) |
39 |
|
#define FL4NELS(n) (((n)+0x1f)>>5) |
40 |
< |
#define CLR4ALL(f,n) bzero((char *)(f),FL4NELS(n)*sizeof(int4)) |
40 |
> |
#define CLR4ALL(f,n) memset((char *)(f),'\0',FL4NELS(n)*sizeof(int32)) |
41 |
|
#endif |
42 |
|
|
43 |
< |
static int4 *pixFlags; /* pixel occupancy flags */ |
43 |
> |
static int32 *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)]) |
47 |
> |
#define isqrt(i2) (isqrttab[i2]) |
48 |
|
|
49 |
|
extern VIEW myview; /* current output view */ |
50 |
|
extern COLOR *mypixel; /* pixels being rendered */ |
53 |
|
extern int hres, vres; /* current horizontal and vertical res. */ |
54 |
|
|
55 |
|
|
56 |
+ |
void |
57 |
|
pixBeam(bp, hb) /* render a particular beam */ |
58 |
|
BEAM *bp; |
59 |
|
register HDBEAMI *hb; |
64 |
|
double d, prox; |
65 |
|
COLOR col; |
66 |
|
int n; |
67 |
< |
register int4 p; |
67 |
> |
register int32 p; |
68 |
|
|
69 |
|
if (!hdbcoord(gc, hb->h, hb->b)) |
70 |
|
error(CONSISTENCY, "bad beam in render_beam"); |
112 |
|
|
113 |
|
|
114 |
|
int |
115 |
< |
kill_occl(h, v, nl, n) /* check for occlusion errors */ |
115 |
> |
kill_occl(h, v, nl, nd, n) /* check for occlusion errors */ |
116 |
|
int h, v; |
117 |
|
register short nl[NNEIGH][2]; |
118 |
+ |
int nd[NNEIGH]; |
119 |
|
int n; |
120 |
|
{ |
121 |
|
short forequad[2][2]; |
122 |
|
int d; |
123 |
< |
register int4 i, p; |
123 |
> |
register int i; |
124 |
> |
register int32 p; |
125 |
|
|
126 |
|
if (n <= 0) { |
127 |
|
#ifdef DEBUG |
132 |
|
p = v*hres + h; |
133 |
|
forequad[0][0] = forequad[0][1] = forequad[1][0] = forequad[1][1] = 0; |
134 |
|
for (i = n; i--; ) { |
135 |
< |
d = (h-nl[i][0])*(h-nl[i][0]) + (v-nl[i][1])*(v-nl[i][1]); |
134 |
< |
d = isqrt(d); |
135 |
> |
d = isqrt(nd[i]); |
136 |
|
if (mydepth[nl[i][1]*hres+nl[i][0]]*(1.+DEPS*d) < mydepth[p]) |
137 |
|
forequad[nl[i][0]<h][nl[i][1]<v] = 1; |
138 |
|
} |
145 |
|
|
146 |
|
|
147 |
|
int |
148 |
< |
smooth_samp(h, v, nl, n) /* grow sample point smoothly */ |
148 |
> |
smooth_samp(h, v, nl, nd, n) /* grow sample point smoothly */ |
149 |
|
int h, v; |
150 |
|
register short nl[NNEIGH][2]; |
151 |
+ |
int nd[NNEIGH]; |
152 |
|
int n; |
153 |
|
{ |
154 |
|
int dis[NNEIGH], ndis; |
155 |
|
COLOR mykern[MAXRAD2]; |
156 |
< |
int4 maxr2; |
156 |
> |
int maxr2; |
157 |
|
double d; |
158 |
< |
register int4 p, r2; |
158 |
> |
register int32 p; |
159 |
> |
register int r2; |
160 |
|
int i, r, maxr, h2, v2; |
161 |
|
|
162 |
|
if (n <= 0) |
163 |
|
return(1); |
164 |
|
p = v*hres + h; /* build kernel values */ |
165 |
< |
maxr2 = (h-nl[n-1][0])*(h-nl[n-1][0]) + (v-nl[n-1][1])*(v-nl[n-1][1]); |
165 |
> |
maxr2 = nd[n-1]; |
166 |
|
DCHECK(maxr2>=MAXRAD2, CONSISTENCY, "out of range neighbor"); |
167 |
|
maxr = isqrt(maxr2); |
168 |
|
for (v2 = 1; v2 <= maxr; v2++) |
174 |
|
} |
175 |
|
ndis = 0; /* find discontinuities */ |
176 |
|
for (i = n; i--; ) { |
177 |
< |
r2 = (h-nl[i][0])*(h-nl[i][0]) + (v-nl[i][1])*(v-nl[i][1]); |
175 |
< |
r = isqrt(r2); |
177 |
> |
r = isqrt(nd[i]); |
178 |
|
d = mydepth[nl[i][1]*hres+nl[i][0]] / mydepth[p]; |
179 |
|
d = d>=1. ? d-1. : 1.-d; |
180 |
|
if (d > r*DEPS || bigdiff(mypixel[p], |
207 |
|
|
208 |
|
|
209 |
|
int |
210 |
< |
random_samp(h, v, nl, n) /* grow sample point noisily */ |
210 |
> |
random_samp(h, v, nl, nd, n, rf) /* gather samples randomly */ |
211 |
|
int h, v; |
212 |
|
register short nl[NNEIGH][2]; |
213 |
+ |
int nd[NNEIGH]; |
214 |
|
int n; |
215 |
+ |
double *rf; |
216 |
|
{ |
217 |
< |
float nwt[NNEIGH]; |
218 |
< |
int4 maxr2; |
219 |
< |
register int4 p, r2; |
220 |
< |
register int i; |
217 |
< |
int maxr, h2, v2; |
218 |
< |
COLOR ctmp; |
217 |
> |
float rnt[NNEIGH]; |
218 |
> |
double rvar; |
219 |
> |
register int32 p, pn; |
220 |
> |
register int ni; |
221 |
|
|
222 |
|
if (n <= 0) |
223 |
|
return(1); |
224 |
< |
p = v*hres + h; /* compute kernel radius */ |
225 |
< |
maxr2 = (h-nl[n-1][0])*(h-nl[n-1][0]) + (v-nl[n-1][1])*(v-nl[n-1][1]); |
226 |
< |
DCHECK(maxr2>=MAXRAD2, CONSISTENCY, "out of range neighbor"); |
227 |
< |
maxr = isqrt(maxr2); |
228 |
< |
/* compute neighbor weights */ |
229 |
< |
for (i = n; i--; ) { |
230 |
< |
r2 = (nl[i][0]-h)*(nl[i][0]-h) + (nl[i][1]-v)*(nl[i][1]-v); |
231 |
< |
nwt[i] = pixWeight[r2]; |
224 |
> |
p = v*hres + h; |
225 |
> |
if (*rf <= FTINY) /* straight Voronoi regions */ |
226 |
> |
ni = 0; |
227 |
> |
else { /* weighted choice */ |
228 |
> |
DCHECK(nd[n-1]>=MAXRAD2, CONSISTENCY, "out of range neighbor"); |
229 |
> |
rnt[0] = pixWeight[nd[0]]; |
230 |
> |
for (ni = 1; ni < n; ni++) |
231 |
> |
rnt[ni] = rnt[ni-1] + pixWeight[nd[ni]]; |
232 |
> |
rvar = rnt[n-1]*pow(frandom(), 1. / *rf); |
233 |
> |
for (ni = 0; rvar > rnt[ni]+FTINY; ni++) |
234 |
> |
; |
235 |
|
} |
236 |
< |
/* sample kernel */ |
237 |
< |
for (v2 = v-maxr; v2 <= v+maxr; v2++) { |
238 |
< |
if (v2 < 0) v2 = 0; |
234 |
< |
else if (v2 >= vres) break; |
235 |
< |
for (h2 = h-maxr; h2 <= h+maxr; h2++) { |
236 |
< |
if (h2 < 0) h2 = 0; |
237 |
< |
else if (h2 >= hres) break; |
238 |
< |
r2 = (h2-h)*(h2-h) + (v2-v)*(v2-v); |
239 |
< |
if (r2 > maxr2) continue; |
240 |
< |
if (CHK4(pixFlags, v2*hres+h2)) |
241 |
< |
continue; /* occupied */ |
242 |
< |
if (frandom() > pixWeight[r2]) { |
243 |
< |
/* pick neighbor instead */ |
244 |
< |
i = random() % n; |
245 |
< |
r2 = nl[i][1]*hres + nl[i][0]; |
246 |
< |
copycolor(ctmp, mypixel[r2]); |
247 |
< |
scalecolor(ctmp, nwt[i]); |
248 |
< |
addcolor(mypixel[v2*hres+h2], ctmp); |
249 |
< |
myweight[v2*hres+h2] += nwt[i] * myweight[r2]; |
250 |
< |
continue; |
251 |
< |
} |
252 |
< |
addcolor(mypixel[v2*hres+h2], mypixel[p]); |
253 |
< |
myweight[v2*hres+h2] += myweight[p]; |
254 |
< |
} |
255 |
< |
} |
236 |
> |
pn = nl[ni][1]*hres + nl[ni][0]; |
237 |
> |
addcolor(mypixel[p], mypixel[pn]); |
238 |
> |
myweight[p] += myweight[pn]; |
239 |
|
return(1); |
240 |
|
} |
241 |
|
|
242 |
|
|
243 |
|
pixFinish(ransamp) /* done with beams -- compute pixel values */ |
244 |
< |
int ransamp; |
244 |
> |
double ransamp; |
245 |
|
{ |
246 |
|
if (pixWeight[0] <= FTINY) |
247 |
|
init_wfunc(); /* initialize weighting function */ |
248 |
|
reset_flags(); /* set occupancy flags */ |
249 |
< |
meet_neighbors(kill_occl); /* eliminate occlusion errors */ |
249 |
> |
meet_neighbors(1,kill_occl,NULL); /* identify occlusion errors */ |
250 |
|
reset_flags(); /* reset occupancy flags */ |
251 |
< |
if (ransamp) /* spread samples over image */ |
252 |
< |
meet_neighbors(random_samp); |
251 |
> |
if (ransamp >= 0.) /* spread samples over image */ |
252 |
> |
meet_neighbors(0,random_samp,&ransamp); |
253 |
|
else |
254 |
< |
meet_neighbors(smooth_samp); |
255 |
< |
free((char *)pixFlags); /* free pixel flags */ |
254 |
> |
meet_neighbors(1,smooth_samp,NULL); |
255 |
> |
free((void *)pixFlags); /* free pixel flags */ |
256 |
|
pixFlags = NULL; |
257 |
|
} |
258 |
|
|
259 |
|
|
260 |
|
reset_flags() /* allocate/set/reset occupancy flags */ |
261 |
|
{ |
262 |
< |
register int4 p; |
262 |
> |
register int32 p; |
263 |
|
|
264 |
|
if (pixFlags == NULL) { |
265 |
< |
pixFlags = (int4 *)calloc(FL4NELS(hres*vres), sizeof(int4)); |
265 |
> |
pixFlags = (int32 *)calloc(FL4NELS(hres*vres), sizeof(int32)); |
266 |
|
CHECK(pixFlags==NULL, SYSTEM, "out of memory in reset_flags"); |
267 |
|
} else |
268 |
|
CLR4ALL(pixFlags, hres*vres); |
274 |
|
|
275 |
|
init_wfunc() /* initialize weighting function */ |
276 |
|
{ |
277 |
< |
register int4 r2; |
277 |
> |
register int r2; |
278 |
|
register double d; |
279 |
|
|
280 |
|
for (r2 = MAXRAD2; --r2; ) { |
288 |
|
|
289 |
|
|
290 |
|
int |
291 |
< |
findneigh(nl, h, v, rnl) /* find NNEIGH neighbors for pixel */ |
291 |
> |
findneigh(nl, nd, h, v, rnl) /* find NNEIGH neighbors for pixel */ |
292 |
|
short nl[NNEIGH][2]; |
293 |
+ |
int nd[NNEIGH]; |
294 |
|
int h, v; |
295 |
|
register short (*rnl)[NNEIGH]; |
296 |
|
{ |
297 |
|
int nn = 0; |
298 |
< |
int4 d, nd[NNEIGH]; |
315 |
< |
int n, hoff; |
298 |
> |
int d, n, hoff; |
299 |
|
register int h2, n2; |
300 |
|
|
301 |
|
nd[NNEIGH-1] = MAXRAD2; |
302 |
< |
for (hoff = 1; hoff < hres; hoff = (hoff<0) - hoff) { |
302 |
> |
for (hoff = 0; hoff < hres; hoff = (hoff<=0) - hoff) { |
303 |
|
h2 = h + hoff; |
304 |
|
if (h2 < 0 | h2 >= hres) |
305 |
|
continue; |
307 |
|
break; |
308 |
|
for (n = 0; n < NNEIGH && rnl[h2][n] < NINF; n++) { |
309 |
|
d = (h2-h)*(h2-h) + (v-rnl[h2][n])*(v-rnl[h2][n]); |
310 |
< |
if (d >= nd[NNEIGH-1]) |
310 |
> |
if (d == 0 | d >= nd[NNEIGH-1]) |
311 |
|
continue; |
312 |
|
if (nn < NNEIGH) /* insert neighbor */ |
313 |
|
nn++; |
328 |
|
} |
329 |
|
|
330 |
|
|
331 |
< |
meet_neighbors(nf) /* run through samples and their neighbors */ |
331 |
> |
meet_neighbors(occ, nf, dp) /* run through samples and their neighbors */ |
332 |
> |
int occ; |
333 |
|
int (*nf)(); |
334 |
+ |
char *dp; |
335 |
|
{ |
336 |
|
short ln[NNEIGH][2]; |
337 |
+ |
int nd[NNEIGH]; |
338 |
|
int h, v, n, v2; |
339 |
|
register short (*rnl)[NNEIGH]; |
340 |
|
/* initialize bottom row list */ |
353 |
|
v = 0; /* do each row */ |
354 |
|
for ( ; ; ) { |
355 |
|
for (h = 0; h < hres; h++) { |
356 |
< |
if (!CHK4(pixFlags, v*hres+h)) |
357 |
< |
continue; /* no one home */ |
358 |
< |
n = findneigh(ln, h, v, rnl); |
359 |
< |
(*nf)(h, v, ln, n); /* call on neighbors */ |
356 |
> |
if (!CHK4(pixFlags, v*hres+h) != !occ) |
357 |
> |
continue; /* occupancy mismatch */ |
358 |
> |
/* find neighbors */ |
359 |
> |
n = findneigh(ln, nd, h, v, rnl); |
360 |
> |
/* call on neighbors */ |
361 |
> |
(*nf)(h, v, ln, nd, n, dp); |
362 |
|
} |
363 |
|
if (++v >= vres) /* reinitialize row list */ |
364 |
|
break; |
373 |
|
} |
374 |
|
} |
375 |
|
} |
376 |
< |
free((char *)rnl); /* free row list */ |
376 |
> |
free((void *)rnl); /* free row list */ |
377 |
|
} |