1 |
– |
/* Copyright (c) 1997 Silicon Graphics, Inc. */ |
2 |
– |
|
1 |
|
#ifndef lint |
2 |
< |
static char SCCSid[] = "$SunId$ SGI"; |
2 |
> |
static const char RCSid[] = "$Id$"; |
3 |
|
#endif |
6 |
– |
|
4 |
|
/* |
5 |
|
* Routines for converting holodeck coordinates, etc. |
6 |
|
* |
11 |
|
|
12 |
|
float hd_depthmap[DCINF-DCLIN]; |
13 |
|
|
14 |
+ |
int hdwg0[6] = {1,1,2,2,0,0}; |
15 |
+ |
int hdwg1[6] = {2,2,0,0,1,1}; |
16 |
+ |
|
17 |
|
static double logstep; |
18 |
|
|
19 |
– |
static int wg0[6] = {1,1,2,2,0,0}; |
20 |
– |
static int wg1[6] = {2,2,0,0,1,1}; |
19 |
|
|
22 |
– |
|
20 |
|
hdcompgrid(hp) /* compute derived grid vector and index */ |
21 |
|
register HOLO *hp; |
22 |
|
{ |
33 |
|
} |
34 |
|
/* compute grid coordinate vectors */ |
35 |
|
for (i = 0; i < 3; i++) { |
36 |
< |
fcross(hp->wn[i], hp->xv[(i+1)%3], hp->xv[(i+2)%3]); |
37 |
< |
if (normalize(hp->wn[i]) == 0.) |
36 |
> |
fcross(hp->wg[i], hp->xv[(i+1)%3], hp->xv[(i+2)%3]); |
37 |
> |
d = DOT(hp->wg[i],hp->xv[i]); |
38 |
> |
if (d <= FTINY & d >= -FTINY) |
39 |
|
error(USER, "degenerate holodeck section"); |
40 |
< |
hp->wo[i<<1] = DOT(hp->wn[i],hp->orig); |
41 |
< |
d = DOT(hp->wn[i],hp->xv[i]); |
44 |
< |
hp->wo[i<<1|1] = hp->wo[i<<1] + d; |
45 |
< |
hp->wg[i] = (double)hp->grid[i] / d; |
40 |
> |
d = hp->grid[i] / d; |
41 |
> |
hp->wg[i][0] *= d; hp->wg[i][1] *= d; hp->wg[i][2] *= d; |
42 |
|
} |
43 |
|
/* compute linear depth range */ |
44 |
|
hp->tlin = VLEN(hp->xv[0]) + VLEN(hp->xv[1]) + VLEN(hp->xv[2]); |
47 |
|
for (i = 1; i < 6; i++) { |
48 |
|
hp->wi[i] = 0; |
49 |
|
for (j = i; j < 6; j++) |
50 |
< |
hp->wi[i] += hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
51 |
< |
hp->wi[i] *= hp->grid[wg0[i-1]] * hp->grid[wg1[i-1]]; |
50 |
> |
hp->wi[i] += hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
51 |
> |
hp->wi[i] *= hp->grid[hdwg0[i-1]] * hp->grid[hdwg1[i-1]]; |
52 |
|
hp->wi[i] += hp->wi[i-1]; |
53 |
|
} |
54 |
|
} |
55 |
|
|
56 |
|
|
61 |
– |
HOLO * |
62 |
– |
hdalloc(hproto) /* allocate and set holodeck section based on grid */ |
63 |
– |
HDGRID *hproto; |
64 |
– |
{ |
65 |
– |
HOLO hdhead; |
66 |
– |
register HOLO *hp; |
67 |
– |
int n; |
68 |
– |
/* copy grid to temporary header */ |
69 |
– |
bcopy((char *)hproto, (char *)&hdhead, sizeof(HDGRID)); |
70 |
– |
/* compute grid vectors and sizes */ |
71 |
– |
hdcompgrid(&hdhead); |
72 |
– |
/* allocate header with directory */ |
73 |
– |
n = sizeof(HOLO)+nbeams(&hdhead)*sizeof(BEAMI); |
74 |
– |
if ((hp = (HOLO *)malloc(n)) == NULL) |
75 |
– |
return(NULL); |
76 |
– |
/* copy header information */ |
77 |
– |
copystruct(hp, &hdhead); |
78 |
– |
/* allocate and clear beam list */ |
79 |
– |
hp->bl = (BEAM **)malloc((nbeams(hp)+1)*sizeof(BEAM *)+sizeof(BEAM)); |
80 |
– |
if (hp->bl == NULL) { |
81 |
– |
free((char *)hp); |
82 |
– |
return(NULL); |
83 |
– |
} |
84 |
– |
bzero((char *)hp->bl, (nbeams(hp)+1)*sizeof(BEAM *)+sizeof(BEAM)); |
85 |
– |
hp->bl[0] = (BEAM *)(hp->bl+nbeams(hp)+1); /* set blglob(hp) */ |
86 |
– |
hp->fd = -1; |
87 |
– |
hp->dirty = 0; |
88 |
– |
hp->priv = NULL; |
89 |
– |
/* clear beam directory */ |
90 |
– |
bzero((char *)hp->bi, (nbeams(hp)+1)*sizeof(BEAMI)); |
91 |
– |
return(hp); /* all is well */ |
92 |
– |
} |
93 |
– |
|
94 |
– |
|
57 |
|
hdbcoord(gc, hp, i) /* compute beam coordinates from index */ |
58 |
|
GCOORD gc[2]; /* returned */ |
59 |
|
register HOLO *hp; |
72 |
|
break; |
73 |
|
i -= hp->wi[gc[0].w=j]; |
74 |
|
/* find w1 */ |
75 |
< |
n2 = hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
75 |
> |
n2 = hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
76 |
|
while (++j < 5) { |
77 |
< |
n = n2 * hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
77 |
> |
n = n2 * hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
78 |
|
if (n > i) |
79 |
|
break; |
80 |
|
i -= n; |
81 |
|
} |
82 |
|
gc[1].w = j; |
83 |
|
/* find position on w0 */ |
84 |
< |
n2 = hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
84 |
> |
n2 = hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
85 |
|
n = i / n2; |
86 |
< |
gc[0].i[1] = n / hp->grid[wg0[gc[0].w]]; |
87 |
< |
gc[0].i[0] = n - gc[0].i[1]*hp->grid[wg0[gc[0].w]]; |
86 |
> |
gc[0].i[1] = n / hp->grid[hdwg0[gc[0].w]]; |
87 |
> |
gc[0].i[0] = n - gc[0].i[1]*hp->grid[hdwg0[gc[0].w]]; |
88 |
|
i -= n*n2; |
89 |
|
/* find position on w1 */ |
90 |
< |
gc[1].i[1] = i / hp->grid[wg0[gc[1].w]]; |
91 |
< |
gc[1].i[0] = i - gc[1].i[1]*hp->grid[wg0[gc[1].w]]; |
90 |
> |
gc[1].i[1] = i / hp->grid[hdwg0[gc[1].w]]; |
91 |
> |
gc[1].i[0] = i - gc[1].i[1]*hp->grid[hdwg0[gc[1].w]]; |
92 |
|
if (reverse) { |
93 |
|
copystruct(g2, gc+1); |
94 |
|
copystruct(gc+1, gc); |
117 |
|
return(0); |
118 |
|
i = 0; /* compute index */ |
119 |
|
for (j = gc[0].w+1; j < gc[1].w; j++) |
120 |
< |
i += hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
121 |
< |
i *= hp->grid[wg0[gc[0].w]] * hp->grid[wg1[gc[0].w]]; |
120 |
> |
i += hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
121 |
> |
i *= hp->grid[hdwg0[gc[0].w]] * hp->grid[hdwg1[gc[0].w]]; |
122 |
|
i += hp->wi[gc[0].w]; |
123 |
< |
i += (hp->grid[wg0[gc[0].w]]*gc[0].i[1] + gc[0].i[0]) * |
124 |
< |
hp->grid[wg0[gc[1].w]] * hp->grid[wg1[gc[1].w]] ; |
125 |
< |
i += hp->grid[wg0[gc[1].w]]*gc[1].i[1] + gc[1].i[0]; |
123 |
> |
i += (hp->grid[hdwg0[gc[0].w]]*gc[0].i[1] + gc[0].i[0]) * |
124 |
> |
hp->grid[hdwg0[gc[1].w]] * hp->grid[hdwg1[gc[1].w]] ; |
125 |
> |
i += hp->grid[hdwg0[gc[1].w]]*gc[1].i[1] + gc[1].i[0]; |
126 |
|
if (reverse) |
127 |
|
i += hp->wi[5] - 1; |
128 |
|
return(i); |
142 |
|
v = hp->xv[gc->w>>1]; |
143 |
|
cp[0][0] += v[0]; cp[0][1] += v[1]; cp[0][2] += v[2]; |
144 |
|
} |
145 |
< |
v = hp->xv[wg0[gc->w]]; |
146 |
< |
d = (double)gc->i[0] / hp->grid[wg0[gc->w]]; |
145 |
> |
v = hp->xv[hdwg0[gc->w]]; |
146 |
> |
d = (double)gc->i[0] / hp->grid[hdwg0[gc->w]]; |
147 |
|
VSUM(cp[0], cp[0], v, d); |
148 |
< |
v = hp->xv[wg1[gc->w]]; |
149 |
< |
d = (double)gc->i[1] / hp->grid[wg1[gc->w]]; |
148 |
> |
v = hp->xv[hdwg1[gc->w]]; |
149 |
> |
d = (double)gc->i[1] / hp->grid[hdwg1[gc->w]]; |
150 |
|
VSUM(cp[0], cp[0], v, d); |
151 |
|
/* compute x1 sums */ |
152 |
< |
v = hp->xv[wg0[gc->w]]; |
153 |
< |
d = 1.0 / hp->grid[wg0[gc->w]]; |
152 |
> |
v = hp->xv[hdwg0[gc->w]]; |
153 |
> |
d = 1.0 / hp->grid[hdwg0[gc->w]]; |
154 |
|
VSUM(cp[1], cp[0], v, d); |
155 |
|
VSUM(cp[3], cp[0], v, d); |
156 |
|
/* compute y1 sums */ |
157 |
< |
v = hp->xv[wg1[gc->w]]; |
158 |
< |
d = 1.0 / hp->grid[wg1[gc->w]]; |
157 |
> |
v = hp->xv[hdwg1[gc->w]]; |
158 |
> |
d = 1.0 / hp->grid[hdwg1[gc->w]]; |
159 |
|
VSUM(cp[2], cp[0], v, d); |
160 |
|
VSUM(cp[3], cp[3], v, d); |
161 |
|
} |
162 |
|
|
163 |
|
|
164 |
< |
hdlseg(lseg, hp, i) /* compute line segment for beam */ |
164 |
> |
hdlseg(lseg, hp, gc) /* compute line segment for beam */ |
165 |
|
register int lseg[2][3]; |
166 |
|
register HOLO *hp; |
167 |
< |
int i; |
167 |
> |
GCOORD gc[2]; |
168 |
|
{ |
207 |
– |
GCOORD gc[2]; |
169 |
|
register int k; |
170 |
|
|
210 |
– |
if (!hdbcoord(gc, hp, i)) /* compute grid coordinates */ |
211 |
– |
return(0); |
171 |
|
for (k = 0; k < 2; k++) { /* compute end points */ |
172 |
|
lseg[k][gc[k].w>>1] = gc[k].w&1 ? hp->grid[gc[k].w>>1]-1 : 0 ; |
173 |
< |
lseg[k][wg0[gc[k].w]] = gc[k].i[0]; |
174 |
< |
lseg[k][wg1[gc[k].w]] = gc[k].i[1]; |
173 |
> |
lseg[k][hdwg0[gc[k].w]] = gc[k].i[0]; |
174 |
> |
lseg[k][hdwg1[gc[k].w]] = gc[k].i[1]; |
175 |
|
} |
176 |
|
return(1); |
177 |
|
} |
183 |
|
double d; |
184 |
|
{ |
185 |
|
double tl = hp->tlin; |
186 |
< |
register unsigned c; |
186 |
> |
register long c; |
187 |
|
|
188 |
|
if (d <= 0.) |
189 |
|
return(0); |
191 |
|
return(DCINF); |
192 |
|
if (d < tl) |
193 |
|
return((unsigned)(d*DCLIN/tl)); |
194 |
< |
c = (unsigned)(log(d/tl)/logstep) + DCLIN; |
195 |
< |
return(c > DCINF ? DCINF : c); |
194 |
> |
c = (long)(log(d/tl)/logstep) + DCLIN; |
195 |
> |
return(c > DCINF ? (unsigned)DCINF : (unsigned)c); |
196 |
|
} |
197 |
|
|
198 |
|
|
203 |
|
{ |
204 |
|
FVECT vt; |
205 |
|
|
206 |
< |
vt[0] = wp[0] - hp->orig[0]; |
207 |
< |
vt[1] = wp[1] - hp->orig[1]; |
208 |
< |
vt[2] = wp[2] - hp->orig[2]; |
209 |
< |
gp[0] = DOT(vt, hp->wn[0]) * hp->wg[0]; |
251 |
< |
gp[1] = DOT(vt, hp->wn[1]) * hp->wg[1]; |
252 |
< |
gp[2] = DOT(vt, hp->wn[2]) * hp->wg[2]; |
206 |
> |
VSUB(vt, wp, hp->orig); |
207 |
> |
gp[0] = DOT(vt, hp->wg[0]); |
208 |
> |
gp[1] = DOT(vt, hp->wg[1]); |
209 |
> |
gp[2] = DOT(vt, hp->wg[2]); |
210 |
|
} |
211 |
|
|
212 |
|
|
213 |
|
hdworld(wp, hp, gp) /* compute world coordinates */ |
214 |
|
register FVECT wp; |
215 |
|
register HOLO *hp; |
216 |
< |
register FVECT gp; |
216 |
> |
FVECT gp; |
217 |
|
{ |
218 |
< |
VSUM(wp, hp->orig, hp->xv[0], gp[0]); |
219 |
< |
VSUM(wp, wp, hp->xv[1], gp[1]); |
220 |
< |
VSUM(wp, wp, hp->xv[2], gp[2]); |
218 |
> |
register double d; |
219 |
> |
|
220 |
> |
d = gp[0]/hp->grid[0]; |
221 |
> |
VSUM(wp, hp->orig, hp->xv[0], d); |
222 |
> |
|
223 |
> |
d = gp[1]/hp->grid[1]; |
224 |
> |
VSUM(wp, wp, hp->xv[1], d); |
225 |
> |
|
226 |
> |
d = gp[2]/hp->grid[2]; |
227 |
> |
VSUM(wp, wp, hp->xv[2], d); |
228 |
|
} |
229 |
|
|
230 |
|
|
248 |
|
d0*cp[1][j] + d1*cp[2][j]; |
249 |
|
} |
250 |
|
VCOPY(ro, p[0]); /* assign ray origin and direction */ |
251 |
< |
rd[0] = p[1][0] - p[0][0]; |
288 |
< |
rd[1] = p[1][1] - p[0][1]; |
289 |
< |
rd[2] = p[1][2] - p[0][2]; |
251 |
> |
VSUB(rd, p[1], p[0]); |
252 |
|
return(normalize(rd)); /* return maximum inside distance */ |
253 |
|
} |
254 |
|
|
255 |
|
|
256 |
|
double |
257 |
< |
hdinter(gc, r, hp, ro, rd) /* compute ray intersection with section */ |
257 |
> |
hdinter(gc, r, ed, hp, ro, rd) /* compute ray intersection with section */ |
258 |
|
register GCOORD gc[2]; /* returned */ |
259 |
< |
BYTE r[2][2]; /* returned */ |
259 |
> |
BYTE r[2][2]; /* returned (optional) */ |
260 |
> |
double *ed; /* returned (optional) */ |
261 |
|
register HOLO *hp; |
262 |
< |
FVECT ro, rd; /* rd should be normalized */ |
262 |
> |
FVECT ro, rd; /* normalization of rd affects distances */ |
263 |
|
{ |
264 |
|
FVECT p[2], vt; |
265 |
|
double d, t0, t1, d0, d1; |
268 |
|
/* first, intersect walls */ |
269 |
|
gc[0].w = gc[1].w = -1; |
270 |
|
t0 = -FHUGE; t1 = FHUGE; |
271 |
+ |
VSUB(vt, ro, hp->orig); |
272 |
|
for (i = 0; i < 3; i++) { /* for each wall pair */ |
273 |
< |
d = -DOT(rd, hp->wn[i]); /* plane distance */ |
273 |
> |
d = -DOT(rd, hp->wg[i]); /* plane distance */ |
274 |
|
if (d <= FTINY && d >= -FTINY) /* check for parallel */ |
275 |
|
continue; |
276 |
< |
d1 = DOT(ro, hp->wn[i]); /* ray distances */ |
277 |
< |
d0 = (d1 - hp->wo[i<<1]) / d; |
278 |
< |
d1 = (d1 - hp->wo[i<<1|1]) / d; |
279 |
< |
if (d0 < d1) { /* check against best */ |
276 |
> |
d1 = DOT(vt, hp->wg[i]); /* ray distances */ |
277 |
> |
d0 = d1 / d; |
278 |
> |
d1 = (d1 - hp->grid[i]) / d; |
279 |
> |
if (d < 0) { /* check against best */ |
280 |
|
if (d0 > t0) { |
281 |
|
t0 = d0; |
282 |
|
gc[0].w = i<<1; |
299 |
|
if (gc[0].w < 0 | gc[1].w < 0) /* paranoid check */ |
300 |
|
return(FHUGE); |
301 |
|
/* compute intersections */ |
302 |
< |
for (i = 0; i < 3; i++) { |
303 |
< |
p[0][i] = ro[i] + rd[i]*t0; |
340 |
< |
p[1][i] = ro[i] + rd[i]*t1; |
341 |
< |
} |
302 |
> |
VSUM(p[0], ro, rd, t0); |
303 |
> |
VSUM(p[1], ro, rd, t1); |
304 |
|
/* now, compute grid coordinates */ |
305 |
|
for (i = 0; i < 2; i++) { |
306 |
< |
vt[0] = p[i][0] - hp->orig[0]; |
307 |
< |
vt[1] = p[i][1] - hp->orig[1]; |
308 |
< |
vt[2] = p[i][2] - hp->orig[2]; |
309 |
< |
v = hp->wn[wg0[gc[i].w]]; |
348 |
< |
d = DOT(vt, v) * hp->wg[wg0[gc[i].w]]; |
349 |
< |
if (d < 0. || (gc[i].i[0] = d) >= hp->grid[wg0[gc[i].w]]) |
306 |
> |
VSUB(vt, p[i], hp->orig); |
307 |
> |
v = hp->wg[hdwg0[gc[i].w]]; |
308 |
> |
d = DOT(vt, v); |
309 |
> |
if (d < 0 || d >= hp->grid[hdwg0[gc[i].w]]) |
310 |
|
return(FHUGE); /* outside wall */ |
311 |
< |
r[i][0] = 256. * (d - gc[i].i[0]); |
312 |
< |
v = hp->wn[wg1[gc[i].w]]; |
313 |
< |
d = DOT(vt, v) * hp->wg[wg1[gc[i].w]]; |
314 |
< |
if (d < 0. || (gc[i].i[1] = d) >= hp->grid[wg1[gc[i].w]]) |
311 |
> |
gc[i].i[0] = d; |
312 |
> |
if (r != NULL) |
313 |
> |
r[i][0] = 256. * (d - gc[i].i[0]); |
314 |
> |
v = hp->wg[hdwg1[gc[i].w]]; |
315 |
> |
d = DOT(vt, v); |
316 |
> |
if (d < 0 || d >= hp->grid[hdwg1[gc[i].w]]) |
317 |
|
return(FHUGE); /* outside wall */ |
318 |
< |
r[i][1] = 256. * (d - gc[i].i[1]); |
318 |
> |
gc[i].i[1] = d; |
319 |
> |
if (r != NULL) |
320 |
> |
r[i][1] = 256. * (d - gc[i].i[1]); |
321 |
|
} |
322 |
< |
/* return distance from entry point */ |
323 |
< |
vt[0] = ro[0] - p[0][0]; |
324 |
< |
vt[1] = ro[1] - p[0][1]; |
361 |
< |
vt[2] = ro[2] - p[0][2]; |
362 |
< |
return(DOT(vt,rd)); |
322 |
> |
if (ed != NULL) /* assign distance to exit point */ |
323 |
> |
*ed = t1; |
324 |
> |
return(t0); /* return distance to entry point */ |
325 |
|
} |