| 1 |
– |
/* Copyright (c) 1990 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_instance.c - routines for computing ray intersections with octrees. |
| 9 |
– |
* |
| 10 |
– |
* 11/11/88 |
| 6 |
|
*/ |
| 7 |
|
|
| 8 |
< |
#include "ray.h" |
| 8 |
> |
#include "copyright.h" |
| 9 |
|
|
| 10 |
+ |
#include "ray.h" |
| 11 |
|
#include "instance.h" |
| 12 |
+ |
#include "rtotypes.h" |
| 13 |
|
|
| 14 |
|
|
| 15 |
< |
o_instance(o, r) /* compute ray intersection with octree */ |
| 16 |
< |
OBJREC *o; |
| 17 |
< |
register RAY *r; |
| 15 |
> |
extern int |
| 16 |
> |
o_instance( /* compute ray intersection with octree */ |
| 17 |
> |
OBJREC *o, |
| 18 |
> |
register RAY *r |
| 19 |
> |
) |
| 20 |
|
{ |
| 22 |
– |
extern long raynum; |
| 21 |
|
RAY rcont; |
| 22 |
< |
register INSTANCE *in; |
| 22 |
> |
double d; |
| 23 |
> |
register INSTANCE *ins; |
| 24 |
|
register int i; |
| 25 |
|
/* get the octree */ |
| 26 |
< |
in = getinstance(o, IO_ALL); |
| 27 |
< |
/* copy old ray */ |
| 28 |
< |
copystruct(&rcont, r); |
| 29 |
< |
/* transform it */ |
| 30 |
< |
rcont.rno = raynum++; |
| 32 |
< |
rcont.ro = NULL; |
| 33 |
< |
rcont.rot = FHUGE; |
| 34 |
< |
multp3(rcont.rorg, r->rorg, in->x.b.xfm); |
| 35 |
< |
multv3(rcont.rdir, r->rdir, in->x.b.xfm); |
| 26 |
> |
ins = getinstance(o, IO_ALL); |
| 27 |
> |
/* copy and transform ray */ |
| 28 |
> |
rcont = *r; |
| 29 |
> |
multp3(rcont.rorg, r->rorg, ins->x.b.xfm); |
| 30 |
> |
multv3(rcont.rdir, r->rdir, ins->x.b.xfm); |
| 31 |
|
for (i = 0; i < 3; i++) |
| 32 |
< |
rcont.rdir[i] /= in->x.b.sca; |
| 33 |
< |
/* trace it */ |
| 34 |
< |
if (!localhit(&rcont, &in->obj->scube)) |
| 35 |
< |
return(0); /* missed */ |
| 36 |
< |
if (rcont.rot * in->x.f.sca >= r->rot) |
| 37 |
< |
return(0); /* not close enough */ |
| 32 |
> |
rcont.rdir[i] /= ins->x.b.sca; |
| 33 |
> |
rcont.rmax *= ins->x.b.sca; |
| 34 |
> |
/* clear and trace it */ |
| 35 |
> |
rayclear(&rcont); |
| 36 |
> |
if (!localhit(&rcont, &ins->obj->scube)) |
| 37 |
> |
return(0); /* missed */ |
| 38 |
> |
if (rcont.rot * ins->x.f.sca >= r->rot) |
| 39 |
> |
return(0); /* not close enough */ |
| 40 |
|
|
| 41 |
|
if (o->omod != OVOID) { /* if we have modifier, use it */ |
| 42 |
|
r->ro = o; |
| 46 |
|
if (rcont.rox != NULL) { |
| 47 |
|
newrayxf(r); /* allocate transformation */ |
| 48 |
|
/* NOTE: r->rox may equal rcont.rox! */ |
| 49 |
< |
multmat4(r->rox->f.xfm, rcont.rox->f.xfm, in->x.f.xfm); |
| 50 |
< |
r->rox->f.sca = rcont.rox->f.sca * in->x.f.sca; |
| 51 |
< |
multmat4(r->rox->b.xfm, in->x.b.xfm, rcont.rox->b.xfm); |
| 52 |
< |
r->rox->b.sca = in->x.b.sca * rcont.rox->b.sca; |
| 49 |
> |
multmat4(r->rox->f.xfm, rcont.rox->f.xfm, ins->x.f.xfm); |
| 50 |
> |
r->rox->f.sca = rcont.rox->f.sca * ins->x.f.sca; |
| 51 |
> |
multmat4(r->rox->b.xfm, ins->x.b.xfm, rcont.rox->b.xfm); |
| 52 |
> |
r->rox->b.sca = ins->x.b.sca * rcont.rox->b.sca; |
| 53 |
|
} else |
| 54 |
< |
r->rox = &in->x; |
| 54 |
> |
r->rox = &ins->x; |
| 55 |
|
} |
| 56 |
|
/* transform it back */ |
| 57 |
< |
r->rot = rcont.rot * in->x.f.sca; |
| 58 |
< |
multp3(r->rop, rcont.rop, in->x.f.xfm); |
| 59 |
< |
multv3(r->ron, rcont.ron, in->x.f.xfm); |
| 60 |
< |
for (i = 0; i < 3; i++) |
| 61 |
< |
r->ron[i] /= in->x.f.sca; |
| 57 |
> |
r->rot = rcont.rot * ins->x.f.sca; |
| 58 |
> |
multp3(r->rop, rcont.rop, ins->x.f.xfm); |
| 59 |
> |
multv3(r->ron, rcont.ron, ins->x.f.xfm); |
| 60 |
> |
multv3(r->pert, rcont.pert, ins->x.f.xfm); |
| 61 |
> |
d = 1./ins->x.f.sca; |
| 62 |
> |
for (i = 0; i < 3; i++) { |
| 63 |
> |
r->ron[i] *= d; |
| 64 |
> |
r->pert[i] *= d; |
| 65 |
> |
} |
| 66 |
|
r->rod = rcont.rod; |
| 67 |
+ |
r->uv[0] = rcont.uv[0]; |
| 68 |
+ |
r->uv[1] = rcont.uv[1]; |
| 69 |
|
/* return hit */ |
| 70 |
|
return(1); |
| 71 |
|
} |
