| 13 |
|
#include "rhdriver.h" |
| 14 |
|
|
| 15 |
|
#ifndef MAXDIST |
| 16 |
< |
#define MAXDIST 13 /* maximum distance outside section */ |
| 16 |
> |
#define MAXDIST 42 /* maximum distance outside section */ |
| 17 |
|
#endif |
| 18 |
|
|
| 19 |
|
extern GCOORD *getviewcells(); |
| 94 |
|
|
| 95 |
|
if (!cb1->wants) /* put orphans at the end, unsorted */ |
| 96 |
|
return(cb2->wants); |
| 97 |
+ |
if (!cb2->wants) |
| 98 |
+ |
return(-1); |
| 99 |
|
if ((c = cb1->bi - cb2->bi)) /* sort on beam index first */ |
| 100 |
|
return(c); |
| 101 |
|
return(cb1->hd - cb2->hd); /* use hd to resolve matches */ |
| 178 |
|
for (i = xcbeams; i--; ) { |
| 179 |
|
pa[i].hd = cbeam[ncbeams+i].hd; |
| 180 |
|
pa[i].bi = cbeam[ncbeams+i].bi; |
| 181 |
< |
pa[i].nr = npixels(v, hr, vr, hdlist[pa[i].hd], pa[i].bi); |
| 181 |
> |
pa[i].nr = npixels(v, hr, vr, hdlist[pa[i].hd], pa[i].bi) + 1; |
| 182 |
|
} |
| 183 |
|
n = xcbeams; /* now sort list for deletions */ |
| 184 |
|
cbeamsort(0); |
| 303 |
|
} |
| 304 |
|
/* check for really stupid move */ |
| 305 |
|
if (bestd > MAXDIST) { |
| 306 |
< |
error(WARNING, "move to outer solar system"); |
| 306 |
> |
error(COMMAND, "move past outer limits"); |
| 307 |
|
return(0); |
| 308 |
|
} |
| 309 |
|
/* warn of dangerous moves */ |
| 354 |
|
GCOORD *gcp; |
| 355 |
|
register struct cellact *cap; |
| 356 |
|
{ |
| 357 |
+ |
register HOLO *hp = hdlist[voxel[cap->vi].hd]; |
| 358 |
|
FVECT org, dir[4]; |
| 359 |
< |
FVECT gp, cv[4], vc; |
| 359 |
> |
FVECT vgp, cgp, vc; |
| 360 |
> |
FVECT v1, v2; |
| 361 |
|
struct beamact bo; |
| 362 |
+ |
int axmax, j; |
| 363 |
+ |
double d, avmax; |
| 364 |
|
register int i; |
| 365 |
< |
/* compute cell vertices */ |
| 366 |
< |
hdcell(cv, hdlist[voxel[cap->vi].hd], gcp); |
| 367 |
< |
/* compute cell and voxel centers */ |
| 368 |
< |
for (i = 0; i < 3; i++) { |
| 369 |
< |
org[i] = 0.5*(cv[0][i] + cv[2][i]); |
| 370 |
< |
gp[i] = voxel[cap->vi].i[i] + 0.5; |
| 371 |
< |
} |
| 372 |
< |
hdworld(vc, hdlist[voxel[cap->vi].hd], gp); |
| 373 |
< |
/* compute voxel pyramid using vector trick */ |
| 374 |
< |
for (i = 0; i < 3; i++) { |
| 375 |
< |
dir[0][i] = vc[i] - cv[0][i]; /* to 3 */ |
| 376 |
< |
dir[2][i] = vc[i] - cv[3][i]; /* to 0 */ |
| 377 |
< |
if (gcp->w & 1) { /* watch vertex order! */ |
| 378 |
< |
dir[1][i] = vc[i] - cv[2][i]; /* to 1 */ |
| 379 |
< |
dir[3][i] = vc[i] - cv[1][i]; /* to 2 */ |
| 380 |
< |
} else { |
| 381 |
< |
dir[1][i] = vc[i] - cv[1][i]; /* to 2 */ |
| 382 |
< |
dir[3][i] = vc[i] - cv[2][i]; /* to 1 */ |
| 365 |
> |
/* compute cell center */ |
| 366 |
> |
cgp[gcp->w>>1] = gcp->w&1 ? hp->grid[gcp->w>>1] : 0 ; |
| 367 |
> |
cgp[((gcp->w>>1)+1)%3] = gcp->i[0] + .5; |
| 368 |
> |
cgp[((gcp->w>>1)+2)%3] = gcp->i[1] + .5; |
| 369 |
> |
hdworld(org, hp, cgp); |
| 370 |
> |
/* compute direction to voxel center */ |
| 371 |
> |
for (i = 3; i--; ) |
| 372 |
> |
vgp[i] = voxel[cap->vi].i[i] + .5; |
| 373 |
> |
hdworld(vc, hp, vgp); |
| 374 |
> |
for (i = 3; i--; ) |
| 375 |
> |
vc[i] -= org[i]; |
| 376 |
> |
/* compute maximum area axis */ |
| 377 |
> |
axmax = -1; avmax = 0; |
| 378 |
> |
for (i = 3; i--; ) { |
| 379 |
> |
d = vgp[i] - cgp[i]; |
| 380 |
> |
if (d < 0.) d = -d; |
| 381 |
> |
if (d > avmax) { |
| 382 |
> |
avmax = d; |
| 383 |
> |
axmax = i; |
| 384 |
|
} |
| 385 |
|
} |
| 386 |
+ |
#ifdef DEBUG |
| 387 |
+ |
if (axmax < 0.) |
| 388 |
+ |
error(CONSISTENCY, "botched axis computation in docell"); |
| 389 |
+ |
#endif |
| 390 |
+ |
/* compute offset vectors */ |
| 391 |
+ |
d = 0.5/hp->grid[j=(axmax+1)%3]; |
| 392 |
+ |
for (i = 3; i--; ) |
| 393 |
+ |
v1[i] = hp->xv[j][i] * d; |
| 394 |
+ |
d = 0.5/hp->grid[j=(axmax+2)%3]; |
| 395 |
+ |
if (DOT(hp->wn[axmax], vc) < 0.) |
| 396 |
+ |
d = -d; /* reverse vertex ordering */ |
| 397 |
+ |
for (i = 3; i--; ) |
| 398 |
+ |
v2[i] = hp->xv[j][i] * d; |
| 399 |
+ |
/* compute voxel pyramid */ |
| 400 |
+ |
for (i = 3; i--; ) { |
| 401 |
+ |
dir[0][i] = vc[i] - v1[i] - v2[i]; |
| 402 |
+ |
dir[1][i] = vc[i] + v1[i] - v2[i]; |
| 403 |
+ |
dir[2][i] = vc[i] + v1[i] + v2[i]; |
| 404 |
+ |
dir[3][i] = vc[i] - v1[i] + v2[i]; |
| 405 |
+ |
} |
| 406 |
|
/* visit beams for opposite cells */ |
| 407 |
|
copystruct(&bo.ca, cap); |
| 408 |
|
copystruct(&bo.gc, gcp); |
| 409 |
< |
return(visit_cells(org, dir, hdlist[voxel[cap->vi].hd], dobeam, &bo)); |
| 409 |
> |
return(visit_cells(org, dir, hp, dobeam, &bo)); |
| 410 |
|
} |
| 411 |
|
|
| 412 |
|
|
| 442 |
|
ngcp = ngcl = getviewcells(&ncnt, hdlist[voxel[voxi].hd], vnew); |
| 443 |
|
/* set up actions */ |
| 444 |
|
oca.vi = nca.vi = voxi; |
| 418 |
– |
oca.rev = nca.rev = 0; |
| 445 |
|
oca.add = 0; nca.add = 1; |
| 446 |
|
if ((oca.rev = ocnt < 0)) |
| 447 |
|
ocnt = -ocnt; |
| 471 |
|
} |
| 472 |
|
|
| 473 |
|
|
| 474 |
+ |
int |
| 475 |
|
beam_sync() /* synchronize beams on server */ |
| 476 |
|
{ |
| 477 |
|
cbeamop(DR_NEWSET, cbeam, ncbeams, &odev.v, odev.hres, odev.vres); |
| 478 |
+ |
return(ncbeams); |
| 479 |
|
} |
| 480 |
|
|
| 481 |
|
|
| 486 |
|
VOXL vlnew[8]; |
| 487 |
|
int n, comn; |
| 488 |
|
|
| 489 |
< |
if (!vn->type) { /* clear our beam list */ |
| 489 |
> |
if (vn == NULL || !vn->type) { /* clear our beam list */ |
| 490 |
|
set_voxels(vlnew, 0); |
| 491 |
|
cbeamop(DR_DELSET, cbeam, ncbeams, NULL, 0, 0); |
| 492 |
|
ncbeams = 0; |
| 493 |
< |
copystruct(&dvw, vn); |
| 493 |
> |
dvw.type = 0; |
| 494 |
|
return(1); |
| 495 |
|
} |
| 496 |
|
/* find our new voxels */ |
