14 |
|
|
15 |
|
float hd_depthmap[DCINF-DCLIN]; |
16 |
|
|
17 |
+ |
int hdwg0[6] = {1,1,2,2,0,0}; |
18 |
+ |
int hdwg1[6] = {2,2,0,0,1,1}; |
19 |
+ |
|
20 |
|
static double logstep; |
21 |
|
|
19 |
– |
static int wg0[6] = {1,1,2,2,0,0}; |
20 |
– |
static int wg1[6] = {2,2,0,0,1,1}; |
22 |
|
|
22 |
– |
|
23 |
|
hdcompgrid(hp) /* compute derived grid vector and index */ |
24 |
|
register HOLO *hp; |
25 |
|
{ |
36 |
|
} |
37 |
|
/* compute grid coordinate vectors */ |
38 |
|
for (i = 0; i < 3; i++) { |
39 |
< |
fcross(hp->wn[i], hp->xv[(i+1)%3], hp->xv[(i+2)%3]); |
40 |
< |
if (normalize(hp->wn[i]) == 0.) |
39 |
> |
fcross(hp->wg[i], hp->xv[(i+1)%3], hp->xv[(i+2)%3]); |
40 |
> |
d = DOT(hp->wg[i],hp->xv[i]); |
41 |
> |
if (d <= FTINY & d >= -FTINY) |
42 |
|
error(USER, "degenerate holodeck section"); |
43 |
< |
hp->wo[i<<1] = DOT(hp->wn[i],hp->orig); |
44 |
< |
d = DOT(hp->wn[i],hp->xv[i]); |
43 |
> |
d = (double)hp->grid[i] / d; |
44 |
> |
hp->wg[i][0] *= d; hp->wg[i][1] *= d; hp->wg[i][2] *= d; |
45 |
> |
hp->wo[i<<1] = DOT(hp->wg[i],hp->orig); |
46 |
> |
d = DOT(hp->wg[i],hp->xv[i]); |
47 |
|
hp->wo[i<<1|1] = hp->wo[i<<1] + d; |
45 |
– |
hp->wg[i] = (double)hp->grid[i] / d; |
48 |
|
} |
49 |
|
/* compute linear depth range */ |
50 |
|
hp->tlin = VLEN(hp->xv[0]) + VLEN(hp->xv[1]) + VLEN(hp->xv[2]); |
53 |
|
for (i = 1; i < 6; i++) { |
54 |
|
hp->wi[i] = 0; |
55 |
|
for (j = i; j < 6; j++) |
56 |
< |
hp->wi[i] += hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
57 |
< |
hp->wi[i] *= hp->grid[wg0[i-1]] * hp->grid[wg1[i-1]]; |
56 |
> |
hp->wi[i] += hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
57 |
> |
hp->wi[i] *= hp->grid[hdwg0[i-1]] * hp->grid[hdwg1[i-1]]; |
58 |
|
hp->wi[i] += hp->wi[i-1]; |
59 |
|
} |
60 |
|
} |
112 |
|
break; |
113 |
|
i -= hp->wi[gc[0].w=j]; |
114 |
|
/* find w1 */ |
115 |
< |
n2 = hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
115 |
> |
n2 = hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
116 |
|
while (++j < 5) { |
117 |
< |
n = n2 * hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
117 |
> |
n = n2 * hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
118 |
|
if (n > i) |
119 |
|
break; |
120 |
|
i -= n; |
121 |
|
} |
122 |
|
gc[1].w = j; |
123 |
|
/* find position on w0 */ |
124 |
< |
n2 = hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
124 |
> |
n2 = hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
125 |
|
n = i / n2; |
126 |
< |
gc[0].i[1] = n / hp->grid[wg0[gc[0].w]]; |
127 |
< |
gc[0].i[0] = n - gc[0].i[1]*hp->grid[wg0[gc[0].w]]; |
126 |
> |
gc[0].i[1] = n / hp->grid[hdwg0[gc[0].w]]; |
127 |
> |
gc[0].i[0] = n - gc[0].i[1]*hp->grid[hdwg0[gc[0].w]]; |
128 |
|
i -= n*n2; |
129 |
|
/* find position on w1 */ |
130 |
< |
gc[1].i[1] = i / hp->grid[wg0[gc[1].w]]; |
131 |
< |
gc[1].i[0] = i - gc[1].i[1]*hp->grid[wg0[gc[1].w]]; |
130 |
> |
gc[1].i[1] = i / hp->grid[hdwg0[gc[1].w]]; |
131 |
> |
gc[1].i[0] = i - gc[1].i[1]*hp->grid[hdwg0[gc[1].w]]; |
132 |
|
if (reverse) { |
133 |
|
copystruct(g2, gc+1); |
134 |
|
copystruct(gc+1, gc); |
157 |
|
return(0); |
158 |
|
i = 0; /* compute index */ |
159 |
|
for (j = gc[0].w+1; j < gc[1].w; j++) |
160 |
< |
i += hp->grid[wg0[j]] * hp->grid[wg1[j]]; |
161 |
< |
i *= hp->grid[wg0[gc[0].w]] * hp->grid[wg1[gc[0].w]]; |
160 |
> |
i += hp->grid[hdwg0[j]] * hp->grid[hdwg1[j]]; |
161 |
> |
i *= hp->grid[hdwg0[gc[0].w]] * hp->grid[hdwg1[gc[0].w]]; |
162 |
|
i += hp->wi[gc[0].w]; |
163 |
< |
i += (hp->grid[wg0[gc[0].w]]*gc[0].i[1] + gc[0].i[0]) * |
164 |
< |
hp->grid[wg0[gc[1].w]] * hp->grid[wg1[gc[1].w]] ; |
165 |
< |
i += hp->grid[wg0[gc[1].w]]*gc[1].i[1] + gc[1].i[0]; |
163 |
> |
i += (hp->grid[hdwg0[gc[0].w]]*gc[0].i[1] + gc[0].i[0]) * |
164 |
> |
hp->grid[hdwg0[gc[1].w]] * hp->grid[hdwg1[gc[1].w]] ; |
165 |
> |
i += hp->grid[hdwg0[gc[1].w]]*gc[1].i[1] + gc[1].i[0]; |
166 |
|
if (reverse) |
167 |
|
i += hp->wi[5] - 1; |
168 |
|
return(i); |
182 |
|
v = hp->xv[gc->w>>1]; |
183 |
|
cp[0][0] += v[0]; cp[0][1] += v[1]; cp[0][2] += v[2]; |
184 |
|
} |
185 |
< |
v = hp->xv[wg0[gc->w]]; |
186 |
< |
d = (double)gc->i[0] / hp->grid[wg0[gc->w]]; |
185 |
> |
v = hp->xv[hdwg0[gc->w]]; |
186 |
> |
d = (double)gc->i[0] / hp->grid[hdwg0[gc->w]]; |
187 |
|
VSUM(cp[0], cp[0], v, d); |
188 |
< |
v = hp->xv[wg1[gc->w]]; |
189 |
< |
d = (double)gc->i[1] / hp->grid[wg1[gc->w]]; |
188 |
> |
v = hp->xv[hdwg1[gc->w]]; |
189 |
> |
d = (double)gc->i[1] / hp->grid[hdwg1[gc->w]]; |
190 |
|
VSUM(cp[0], cp[0], v, d); |
191 |
|
/* compute x1 sums */ |
192 |
< |
v = hp->xv[wg0[gc->w]]; |
193 |
< |
d = 1.0 / hp->grid[wg0[gc->w]]; |
192 |
> |
v = hp->xv[hdwg0[gc->w]]; |
193 |
> |
d = 1.0 / hp->grid[hdwg0[gc->w]]; |
194 |
|
VSUM(cp[1], cp[0], v, d); |
195 |
|
VSUM(cp[3], cp[0], v, d); |
196 |
|
/* compute y1 sums */ |
197 |
< |
v = hp->xv[wg1[gc->w]]; |
198 |
< |
d = 1.0 / hp->grid[wg1[gc->w]]; |
197 |
> |
v = hp->xv[hdwg1[gc->w]]; |
198 |
> |
d = 1.0 / hp->grid[hdwg1[gc->w]]; |
199 |
|
VSUM(cp[2], cp[0], v, d); |
200 |
|
VSUM(cp[3], cp[3], v, d); |
201 |
|
} |
210 |
|
|
211 |
|
for (k = 0; k < 2; k++) { /* compute end points */ |
212 |
|
lseg[k][gc[k].w>>1] = gc[k].w&1 ? hp->grid[gc[k].w>>1]-1 : 0 ; |
213 |
< |
lseg[k][wg0[gc[k].w]] = gc[k].i[0]; |
214 |
< |
lseg[k][wg1[gc[k].w]] = gc[k].i[1]; |
213 |
> |
lseg[k][hdwg0[gc[k].w]] = gc[k].i[0]; |
214 |
> |
lseg[k][hdwg1[gc[k].w]] = gc[k].i[1]; |
215 |
|
} |
216 |
|
return(1); |
217 |
|
} |
223 |
|
double d; |
224 |
|
{ |
225 |
|
double tl = hp->tlin; |
226 |
< |
register unsigned c; |
226 |
> |
register long c; |
227 |
|
|
228 |
|
if (d <= 0.) |
229 |
|
return(0); |
231 |
|
return(DCINF); |
232 |
|
if (d < tl) |
233 |
|
return((unsigned)(d*DCLIN/tl)); |
234 |
< |
c = (unsigned)(log(d/tl)/logstep) + DCLIN; |
235 |
< |
return(c > DCINF ? DCINF : c); |
234 |
> |
c = (long)(log(d/tl)/logstep) + DCLIN; |
235 |
> |
return(c > DCINF ? (unsigned)DCINF : (unsigned)c); |
236 |
|
} |
237 |
|
|
238 |
|
|
246 |
|
vt[0] = wp[0] - hp->orig[0]; |
247 |
|
vt[1] = wp[1] - hp->orig[1]; |
248 |
|
vt[2] = wp[2] - hp->orig[2]; |
249 |
< |
gp[0] = DOT(vt, hp->wn[0]) * hp->wg[0]; |
250 |
< |
gp[1] = DOT(vt, hp->wn[1]) * hp->wg[1]; |
251 |
< |
gp[2] = DOT(vt, hp->wn[2]) * hp->wg[2]; |
249 |
> |
gp[0] = DOT(vt, hp->wg[0]); |
250 |
> |
gp[1] = DOT(vt, hp->wg[1]); |
251 |
> |
gp[2] = DOT(vt, hp->wg[2]); |
252 |
|
} |
253 |
|
|
254 |
|
|
300 |
|
double |
301 |
|
hdinter(gc, r, ed, hp, ro, rd) /* compute ray intersection with section */ |
302 |
|
register GCOORD gc[2]; /* returned */ |
303 |
< |
BYTE r[2][2]; /* returned */ |
303 |
> |
BYTE r[2][2]; /* returned (optional) */ |
304 |
|
double *ed; /* returned (optional) */ |
305 |
|
register HOLO *hp; |
306 |
< |
FVECT ro, rd; /* rd should be normalized */ |
306 |
> |
FVECT ro, rd; /* normalization of rd affects distances */ |
307 |
|
{ |
308 |
|
FVECT p[2], vt; |
309 |
|
double d, t0, t1, d0, d1; |
313 |
|
gc[0].w = gc[1].w = -1; |
314 |
|
t0 = -FHUGE; t1 = FHUGE; |
315 |
|
for (i = 0; i < 3; i++) { /* for each wall pair */ |
316 |
< |
d = -DOT(rd, hp->wn[i]); /* plane distance */ |
316 |
> |
d = -DOT(rd, hp->wg[i]); /* plane distance */ |
317 |
|
if (d <= FTINY && d >= -FTINY) /* check for parallel */ |
318 |
|
continue; |
319 |
< |
d1 = DOT(ro, hp->wn[i]); /* ray distances */ |
319 |
> |
d1 = DOT(ro, hp->wg[i]); /* ray distances */ |
320 |
|
d0 = (d1 - hp->wo[i<<1]) / d; |
321 |
|
d1 = (d1 - hp->wo[i<<1|1]) / d; |
322 |
|
if (d0 < d1) { /* check against best */ |
351 |
|
vt[0] = p[i][0] - hp->orig[0]; |
352 |
|
vt[1] = p[i][1] - hp->orig[1]; |
353 |
|
vt[2] = p[i][2] - hp->orig[2]; |
354 |
< |
v = hp->wn[wg0[gc[i].w]]; |
355 |
< |
d = DOT(vt, v) * hp->wg[wg0[gc[i].w]]; |
356 |
< |
if (d < 0. || (gc[i].i[0] = d) >= hp->grid[wg0[gc[i].w]]) |
354 |
> |
v = hp->wg[hdwg0[gc[i].w]]; |
355 |
> |
d = DOT(vt, v); |
356 |
> |
if (d < 0. || (gc[i].i[0] = d) >= hp->grid[hdwg0[gc[i].w]]) |
357 |
|
return(FHUGE); /* outside wall */ |
358 |
< |
r[i][0] = 256. * (d - gc[i].i[0]); |
359 |
< |
v = hp->wn[wg1[gc[i].w]]; |
360 |
< |
d = DOT(vt, v) * hp->wg[wg1[gc[i].w]]; |
361 |
< |
if (d < 0. || (gc[i].i[1] = d) >= hp->grid[wg1[gc[i].w]]) |
358 |
> |
if (r != NULL) |
359 |
> |
r[i][0] = 256. * (d - gc[i].i[0]); |
360 |
> |
v = hp->wg[hdwg1[gc[i].w]]; |
361 |
> |
d = DOT(vt, v); |
362 |
> |
if (d < 0. || (gc[i].i[1] = d) >= hp->grid[hdwg1[gc[i].w]]) |
363 |
|
return(FHUGE); /* outside wall */ |
364 |
< |
r[i][1] = 256. * (d - gc[i].i[1]); |
364 |
> |
if (r != NULL) |
365 |
> |
r[i][1] = 256. * (d - gc[i].i[1]); |
366 |
|
} |
363 |
– |
|
367 |
|
if (ed != NULL) /* assign distance to exit point */ |
368 |
|
*ed = t1; |
369 |
|
return(t0); /* return distance to entry point */ |