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" |
13 |
|
|
14 |
|
#ifndef DEPS |
15 |
|
#define DEPS 0.02 /* depth epsilon */ |
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 */ |
52 |
|
extern float *mydepth; /* depth values (visibility culling) */ |
53 |
|
extern int hres, vres; /* current horizontal and vertical res. */ |
54 |
|
|
55 |
+ |
extern void pixFinish(double ransamp); |
56 |
+ |
extern void pixBeam(BEAM *bp, HDBEAMI *hb); |
57 |
|
|
58 |
< |
pixBeam(bp, hb) /* render a particular beam */ |
59 |
< |
BEAM *bp; |
60 |
< |
register HDBEAMI *hb; |
58 |
> |
typedef int (sampfunc)(int h, int v, short nl[NNEIGH][2], int nd[NNEIGH], |
59 |
> |
int n, double *rf); |
60 |
> |
static sampfunc kill_occl; |
61 |
> |
static sampfunc smooth_samp; |
62 |
> |
static sampfunc random_samp; |
63 |
> |
static void meet_neighbors(int occ, sampfunc *nf, double *dp); |
64 |
> |
static void reset_flags(void); |
65 |
> |
static void init_wfunc(void); |
66 |
> |
static int findneigh(short nl[NNEIGH][2], int nd[NNEIGH], int h, int v, |
67 |
> |
register short (*rnl)[NNEIGH]); |
68 |
> |
|
69 |
> |
|
70 |
> |
extern void |
71 |
> |
pixBeam( /* render a particular beam */ |
72 |
> |
BEAM *bp, |
73 |
> |
register HDBEAMI *hb |
74 |
> |
) |
75 |
|
{ |
76 |
|
GCOORD gc[2]; |
77 |
|
register RAYVAL *rv; |
79 |
|
double d, prox; |
80 |
|
COLOR col; |
81 |
|
int n; |
82 |
< |
register int4 p; |
82 |
> |
register int32 p; |
83 |
|
|
84 |
|
if (!hdbcoord(gc, hb->h, hb->b)) |
85 |
|
error(CONSISTENCY, "bad beam in render_beam"); |
126 |
|
} |
127 |
|
|
128 |
|
|
129 |
< |
int |
130 |
< |
kill_occl(h, v, nl, n) /* check for occlusion errors */ |
131 |
< |
int h, v; |
132 |
< |
register short nl[NNEIGH][2]; |
133 |
< |
int n; |
129 |
> |
static int |
130 |
> |
kill_occl( /* check for occlusion errors */ |
131 |
> |
int h, |
132 |
> |
int v, |
133 |
> |
register short nl[NNEIGH][2], |
134 |
> |
int nd[NNEIGH], |
135 |
> |
int n, |
136 |
> |
double *rf |
137 |
> |
) |
138 |
|
{ |
139 |
|
short forequad[2][2]; |
140 |
|
int d; |
141 |
< |
register int4 i, p; |
141 |
> |
register int i; |
142 |
> |
register int32 p; |
143 |
|
|
144 |
< |
if (n <= 0) |
144 |
> |
if (n <= 0) { |
145 |
> |
#ifdef DEBUG |
146 |
> |
error(WARNING, "neighborless sample in kill_occl"); |
147 |
> |
#endif |
148 |
|
return(1); |
149 |
+ |
} |
150 |
|
p = v*hres + h; |
151 |
|
forequad[0][0] = forequad[0][1] = forequad[1][0] = forequad[1][1] = 0; |
152 |
|
for (i = n; i--; ) { |
153 |
< |
d = (h-nl[i][0])*(h-nl[i][0]) + (v-nl[i][1])*(v-nl[i][1]); |
129 |
< |
d = isqrt(d); |
153 |
> |
d = isqrt(nd[i]); |
154 |
|
if (mydepth[nl[i][1]*hres+nl[i][0]]*(1.+DEPS*d) < mydepth[p]) |
155 |
|
forequad[nl[i][0]<h][nl[i][1]<v] = 1; |
156 |
|
} |
162 |
|
} |
163 |
|
|
164 |
|
|
165 |
< |
int |
166 |
< |
grow_samp(h, v, nl, n) /* grow sample point appropriately */ |
167 |
< |
int h, v; |
168 |
< |
register short nl[NNEIGH][2]; |
169 |
< |
int n; |
165 |
> |
static int |
166 |
> |
smooth_samp( /* grow sample point smoothly */ |
167 |
> |
int h, |
168 |
> |
int v, |
169 |
> |
register short nl[NNEIGH][2], |
170 |
> |
int nd[NNEIGH], |
171 |
> |
int n, |
172 |
> |
double *rf |
173 |
> |
) |
174 |
|
{ |
175 |
|
int dis[NNEIGH], ndis; |
176 |
|
COLOR mykern[MAXRAD2]; |
177 |
< |
int4 maxr2; |
178 |
< |
double w, d; |
179 |
< |
register int4 p, r2; |
177 |
> |
int maxr2; |
178 |
> |
double d; |
179 |
> |
register int32 p; |
180 |
> |
register int r2; |
181 |
|
int i, r, maxr, h2, v2; |
182 |
|
|
183 |
|
if (n <= 0) |
184 |
|
return(1); |
185 |
|
p = v*hres + h; /* build kernel values */ |
186 |
< |
maxr2 = (h-nl[n-1][0])*(h-nl[n-1][0]) + (v-nl[n-1][1])*(v-nl[n-1][1]); |
186 |
> |
maxr2 = nd[n-1]; |
187 |
|
DCHECK(maxr2>=MAXRAD2, CONSISTENCY, "out of range neighbor"); |
188 |
|
maxr = isqrt(maxr2); |
189 |
|
for (v2 = 1; v2 <= maxr; v2++) |
195 |
|
} |
196 |
|
ndis = 0; /* find discontinuities */ |
197 |
|
for (i = n; i--; ) { |
198 |
< |
r2 = (h-nl[i][0])*(h-nl[i][0]) + (v-nl[i][1])*(v-nl[i][1]); |
170 |
< |
r = isqrt(r2); |
198 |
> |
r = isqrt(nd[i]); |
199 |
|
d = mydepth[nl[i][1]*hres+nl[i][0]] / mydepth[p]; |
200 |
|
d = d>=1. ? d-1. : 1.-d; |
201 |
|
if (d > r*DEPS || bigdiff(mypixel[p], |
220 |
|
} |
221 |
|
if (i >= 0) continue; /* outside edge */ |
222 |
|
addcolor(mypixel[v2*hres+h2], mykern[r2]); |
223 |
< |
myweight[v2*hres+h2] += pixWeight[r2] * |
196 |
< |
myweight[v*hres+h]; |
223 |
> |
myweight[v2*hres+h2] += pixWeight[r2] * myweight[p]; |
224 |
|
} |
225 |
|
} |
226 |
|
return(1); |
227 |
|
} |
228 |
|
|
229 |
|
|
230 |
< |
pixFlush() /* done with beams -- flush pixel values */ |
230 |
> |
static int |
231 |
> |
random_samp( /* gather samples randomly */ |
232 |
> |
int h, |
233 |
> |
int v, |
234 |
> |
register short nl[NNEIGH][2], |
235 |
> |
int nd[NNEIGH], |
236 |
> |
int n, |
237 |
> |
double *rf |
238 |
> |
) |
239 |
|
{ |
240 |
< |
reset_flags(); /* set occupancy flags */ |
241 |
< |
meet_neighbors(kill_occl); /* eliminate occlusion errors */ |
242 |
< |
reset_flags(); /* reset occupancy flags */ |
240 |
> |
float rnt[NNEIGH]; |
241 |
> |
double rvar; |
242 |
> |
register int32 p, pn; |
243 |
> |
register int ni; |
244 |
> |
|
245 |
> |
if (n <= 0) |
246 |
> |
return(1); |
247 |
> |
p = v*hres + h; |
248 |
> |
if (*rf <= FTINY) /* straight Voronoi regions */ |
249 |
> |
ni = 0; |
250 |
> |
else { /* weighted choice */ |
251 |
> |
DCHECK(nd[n-1]>=MAXRAD2, CONSISTENCY, "out of range neighbor"); |
252 |
> |
rnt[0] = pixWeight[nd[0]]; |
253 |
> |
for (ni = 1; ni < n; ni++) |
254 |
> |
rnt[ni] = rnt[ni-1] + pixWeight[nd[ni]]; |
255 |
> |
rvar = rnt[n-1]*pow(frandom(), 1. / *rf); |
256 |
> |
for (ni = 0; rvar > rnt[ni]+FTINY; ni++) |
257 |
> |
; |
258 |
> |
} |
259 |
> |
pn = nl[ni][1]*hres + nl[ni][0]; |
260 |
> |
addcolor(mypixel[p], mypixel[pn]); |
261 |
> |
myweight[p] += myweight[pn]; |
262 |
> |
return(1); |
263 |
> |
} |
264 |
> |
|
265 |
> |
|
266 |
> |
extern void |
267 |
> |
pixFinish( /* done with beams -- compute pixel values */ |
268 |
> |
double ransamp |
269 |
> |
) |
270 |
> |
{ |
271 |
|
if (pixWeight[0] <= FTINY) |
272 |
|
init_wfunc(); /* initialize weighting function */ |
273 |
< |
meet_neighbors(grow_samp); /* grow valid samples over image */ |
274 |
< |
free((char *)pixFlags); /* free pixel flags */ |
273 |
> |
reset_flags(); /* set occupancy flags */ |
274 |
> |
meet_neighbors(1,kill_occl,NULL); /* identify occlusion errors */ |
275 |
> |
reset_flags(); /* reset occupancy flags */ |
276 |
> |
if (ransamp >= 0.) /* spread samples over image */ |
277 |
> |
meet_neighbors(0,random_samp,&ransamp); |
278 |
> |
else |
279 |
> |
meet_neighbors(1,smooth_samp,NULL); |
280 |
> |
free((void *)pixFlags); /* free pixel flags */ |
281 |
|
pixFlags = NULL; |
282 |
|
} |
283 |
|
|
284 |
|
|
285 |
< |
reset_flags() /* allocate/set/reset occupancy flags */ |
285 |
> |
static void |
286 |
> |
reset_flags(void) /* allocate/set/reset occupancy flags */ |
287 |
|
{ |
288 |
< |
register int4 p; |
288 |
> |
register int32 p; |
289 |
|
|
290 |
|
if (pixFlags == NULL) { |
291 |
< |
pixFlags = (int4 *)calloc(FL4NELS(hres*vres), sizeof(int4)); |
291 |
> |
pixFlags = (int32 *)calloc(FL4NELS(hres*vres), sizeof(int32)); |
292 |
|
CHECK(pixFlags==NULL, SYSTEM, "out of memory in reset_flags"); |
293 |
|
} else |
294 |
|
CLR4ALL(pixFlags, hres*vres); |
298 |
|
} |
299 |
|
|
300 |
|
|
301 |
< |
init_wfunc() /* initialize weighting function */ |
301 |
> |
static void |
302 |
> |
init_wfunc(void) /* initialize weighting function */ |
303 |
|
{ |
304 |
< |
register int i, j; |
234 |
< |
register int4 r2; |
304 |
> |
register int r2; |
305 |
|
register double d; |
306 |
|
|
307 |
< |
for (i = 1; i <= MAXRAD; i++) |
308 |
< |
for (j = 0; j <= i; j++) { |
309 |
< |
r2 = i*i + j*j; |
310 |
< |
if (r2 >= MAXRAD2) break; |
311 |
< |
d = sqrt((double)r2); |
242 |
< |
pixWeight[r2] = G0NORM/d; |
243 |
< |
isqrttab[r2] = d + 0.99; |
244 |
< |
} |
307 |
> |
for (r2 = MAXRAD2; --r2; ) { |
308 |
> |
d = sqrt((double)r2); |
309 |
> |
pixWeight[r2] = G0NORM/d; |
310 |
> |
isqrttab[r2] = d + 0.99; |
311 |
> |
} |
312 |
|
pixWeight[0] = 1.; |
313 |
|
isqrttab[0] = 0; |
314 |
|
} |
315 |
|
|
316 |
|
|
317 |
< |
int |
318 |
< |
findneigh(nl, h, v, rnl) /* find NNEIGH neighbors for pixel */ |
319 |
< |
short nl[NNEIGH][2]; |
320 |
< |
int h, v; |
321 |
< |
register short (*rnl)[NNEIGH]; |
317 |
> |
static int |
318 |
> |
findneigh( /* find NNEIGH neighbors for pixel */ |
319 |
> |
short nl[NNEIGH][2], |
320 |
> |
int nd[NNEIGH], |
321 |
> |
int h, |
322 |
> |
int v, |
323 |
> |
register short (*rnl)[NNEIGH] |
324 |
> |
) |
325 |
|
{ |
326 |
|
int nn = 0; |
327 |
< |
int4 d, nd[NNEIGH]; |
258 |
< |
int n, hoff; |
327 |
> |
int d, n, hoff; |
328 |
|
register int h2, n2; |
329 |
|
|
330 |
|
nd[NNEIGH-1] = MAXRAD2; |
331 |
< |
for (hoff = 1; hoff < hres; hoff = (hoff<0) - hoff) { |
331 |
> |
for (hoff = 0; hoff < hres; hoff = (hoff<=0) - hoff) { |
332 |
|
h2 = h + hoff; |
333 |
< |
if (h2 < 0 | h2 >= hres) |
333 |
> |
if ((h2 < 0) | (h2 >= hres)) |
334 |
|
continue; |
335 |
|
if ((h2-h)*(h2-h) >= nd[NNEIGH-1]) |
336 |
|
break; |
337 |
|
for (n = 0; n < NNEIGH && rnl[h2][n] < NINF; n++) { |
338 |
|
d = (h2-h)*(h2-h) + (v-rnl[h2][n])*(v-rnl[h2][n]); |
339 |
< |
if (d >= nd[NNEIGH-1]) |
339 |
> |
if ((d == 0) | (d >= nd[NNEIGH-1])) |
340 |
|
continue; |
341 |
|
if (nn < NNEIGH) /* insert neighbor */ |
342 |
|
nn++; |
357 |
|
} |
358 |
|
|
359 |
|
|
360 |
< |
meet_neighbors(nf) /* run through samples and their neighbors */ |
361 |
< |
int (*nf)(); |
360 |
> |
static void |
361 |
> |
meet_neighbors( /* run through samples and their neighbors */ |
362 |
> |
int occ, |
363 |
> |
sampfunc *nf, |
364 |
> |
double *dp |
365 |
> |
) |
366 |
|
{ |
367 |
|
short ln[NNEIGH][2]; |
368 |
+ |
int nd[NNEIGH]; |
369 |
|
int h, v, n, v2; |
370 |
|
register short (*rnl)[NNEIGH]; |
371 |
|
/* initialize bottom row list */ |
384 |
|
v = 0; /* do each row */ |
385 |
|
for ( ; ; ) { |
386 |
|
for (h = 0; h < hres; h++) { |
387 |
< |
if (!CHK4(pixFlags, v*hres+h)) |
388 |
< |
continue; /* no one home */ |
389 |
< |
n = findneigh(ln, h, v, rnl); |
390 |
< |
(*nf)(h, v, ln, n); /* call on neighbors */ |
387 |
> |
if (!CHK4(pixFlags, v*hres+h) != !occ) |
388 |
> |
continue; /* occupancy mismatch */ |
389 |
> |
/* find neighbors */ |
390 |
> |
n = findneigh(ln, nd, h, v, rnl); |
391 |
> |
/* call on neighbors */ |
392 |
> |
(*nf)(h, v, ln, nd, n, dp); |
393 |
|
} |
394 |
|
if (++v >= vres) /* reinitialize row list */ |
395 |
|
break; |
404 |
|
} |
405 |
|
} |
406 |
|
} |
407 |
< |
free((char *)rnl); /* free row list */ |
407 |
> |
free((void *)rnl); /* free row list */ |
408 |
|
} |