| 1 |
– |
/* Copyright (c) 1986 Regents of the University of California */ |
| 2 |
– |
|
| 1 |
|
#ifndef lint |
| 2 |
< |
static char SCCSid[] = "$SunId$ LBL"; |
| 2 |
> |
static const char RCSid[] = "$Id$"; |
| 3 |
|
#endif |
| 6 |
– |
|
| 4 |
|
/* |
| 5 |
|
* o_cone.c - routine to determine ray intersection with cones. |
| 9 |
– |
* |
| 10 |
– |
* 2/13/86 |
| 6 |
|
*/ |
| 7 |
|
|
| 8 |
< |
#include "ray.h" |
| 8 |
> |
#include "copyright.h" |
| 9 |
|
|
| 10 |
+ |
#include "ray.h" |
| 11 |
|
#include "otypes.h" |
| 12 |
< |
|
| 12 |
> |
#include "rtotypes.h" |
| 13 |
|
#include "cone.h" |
| 14 |
|
|
| 15 |
|
|
| 16 |
< |
o_cone(o, r) /* intersect ray with cone */ |
| 17 |
< |
OBJREC *o; |
| 18 |
< |
register RAY *r; |
| 16 |
> |
int |
| 17 |
> |
o_cone( /* intersect ray with cone */ |
| 18 |
> |
OBJREC *o, |
| 19 |
> |
RAY *r |
| 20 |
> |
) |
| 21 |
|
{ |
| 22 |
|
FVECT rox, rdx; |
| 23 |
|
double a, b, c; |
| 24 |
|
double root[2]; |
| 25 |
|
int nroots, rn; |
| 26 |
< |
register CONE *co; |
| 27 |
< |
register int i; |
| 26 |
> |
CONE *co; |
| 27 |
> |
int i; |
| 28 |
|
|
| 29 |
|
/* get cone structure */ |
| 30 |
|
co = getcone(o, 1); |
| 31 |
+ |
if (co == NULL) |
| 32 |
+ |
objerror(o, INTERNAL, "unexpected illegal"); |
| 33 |
|
|
| 34 |
|
/* |
| 35 |
|
* To intersect a ray with a cone, we transform the |
| 70 |
|
|
| 71 |
|
} else { /* OBJ_RING */ |
| 72 |
|
|
| 73 |
< |
if (rdx[2] <= FTINY && rdx[2] >= -FTINY) |
| 73 |
> |
if ((rdx[2] <= FTINY) & (rdx[2] >= -FTINY)) |
| 74 |
|
return(0); /* parallel */ |
| 75 |
|
root[0] = -rox[2]/rdx[2]; |
| 76 |
< |
if (root[0] <= FTINY || root[0] >= r->rot) |
| 77 |
< |
return(0); /* distance check */ |
| 76 |
> |
if (rayreject(o, r, root[0], -rdx[2])) |
| 77 |
> |
return(0); /* have better */ |
| 78 |
|
b = root[0]*rdx[0] + rox[0]; |
| 79 |
|
c = root[0]*rdx[1] + rox[1]; |
| 80 |
|
a = b*b + c*c; |
| 82 |
|
return(0); /* outside radii */ |
| 83 |
|
r->ro = o; |
| 84 |
|
r->rot = root[0]; |
| 85 |
< |
for (i = 0; i < 3; i++) |
| 86 |
< |
r->rop[i] = r->rorg[i] + r->rdir[i]*r->rot; |
| 85 |
> |
VSUM(r->rop, r->rorg, r->rdir, r->rot); |
| 86 |
|
VCOPY(r->ron, co->ad); |
| 87 |
|
r->rod = -rdx[2]; |
| 88 |
< |
r->rofs = 1.0; setident4(r->rofx); |
| 89 |
< |
r->robs = 1.0; setident4(r->robx); |
| 88 |
> |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
| 89 |
> |
r->uv[0] = r->uv[1] = 0.0; |
| 90 |
> |
r->rox = NULL; |
| 91 |
|
return(1); /* good */ |
| 92 |
|
} |
| 93 |
|
/* roots for cone, cup, cyl., tube */ |
| 96 |
|
for (rn = 0; rn < nroots; rn++) { /* check real roots */ |
| 97 |
|
if (root[rn] <= FTINY) |
| 98 |
|
continue; /* too small */ |
| 99 |
< |
if (root[rn] >= r->rot) |
| 99 |
> |
if (root[rn] > r->rot + FTINY) |
| 100 |
|
break; /* too big */ |
| 101 |
|
/* check endpoints */ |
| 102 |
< |
for (i = 0; i < 3; i++) { |
| 103 |
< |
rox[i] = r->rorg[i] + root[rn]*r->rdir[i]; |
| 104 |
< |
rdx[i] = rox[i] - CO_P0(co)[i]; |
| 105 |
< |
} |
| 102 |
> |
VSUM(rox, r->rorg, r->rdir, root[rn]); |
| 103 |
> |
VSUB(rdx, rox, CO_P0(co)); |
| 104 |
|
b = DOT(rdx, co->ad); |
| 105 |
|
if (b < 0.0) |
| 106 |
|
continue; /* before p0 */ |
| 107 |
|
if (b > co->al) |
| 108 |
|
continue; /* after p1 */ |
| 109 |
+ |
if (rayreject(o, r, root[rn], 0)) |
| 110 |
+ |
break; /* previous hit better */ |
| 111 |
|
r->ro = o; |
| 112 |
|
r->rot = root[rn]; |
| 113 |
|
VCOPY(r->rop, rox); |
| 129 |
|
if (o->otype == OBJ_CONE || o->otype == OBJ_CUP) |
| 130 |
|
for (i = 0; i < 3; i++) |
| 131 |
|
r->ron[i] = (co->al*r->ron[i] - c*co->ad[i]) |
| 132 |
< |
/co->sl; |
| 132 |
> |
/ co->sl; |
| 133 |
> |
a = DOT(r->ron, r->ron); |
| 134 |
> |
if (a > 1.+FTINY || a < 1.-FTINY) { |
| 135 |
> |
c = 1./(.5 + .5*a); /* avoid numerical error */ |
| 136 |
> |
r->ron[0] *= c; r->ron[1] *= c; r->ron[2] *= c; |
| 137 |
> |
} |
| 138 |
|
r->rod = -DOT(r->rdir, r->ron); |
| 139 |
< |
r->rofs = 1.0; setident4(r->rofx); |
| 140 |
< |
r->robs = 1.0; setident4(r->robx); |
| 139 |
> |
r->pert[0] = r->pert[1] = r->pert[2] = 0.0; |
| 140 |
> |
r->uv[0] = r->uv[1] = 0.0; |
| 141 |
> |
r->rox = NULL; |
| 142 |
|
return(1); /* good */ |
| 143 |
|
} |
| 144 |
|
return(0); |
