ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/ot/o_cone.c
Revision: 2.6
Committed: Wed Nov 21 18:51:04 2007 UTC (16 years, 8 months ago) by greg
Content type: text/plain
Branch: MAIN
CVS Tags: rad4R2P2, rad5R0, rad4R2, rad4R1, rad4R0, rad3R9, rad4R2P1
Changes since 2.5: +2 -1 lines
Log Message:
Fixed implicit declarations

File Contents

# User Rev Content
1 greg 1.1 #ifndef lint
2 greg 2.6 static const char RCSid[] = "$Id: o_cone.c,v 2.5 2005/06/14 17:10:06 greg Exp $";
3 greg 1.1 #endif
4     /*
5     * o_cone.c - routines for intersecting cubes with cones.
6     *
7     * 2/3/86
8     */
9    
10     #include "standard.h"
11     #include "octree.h"
12     #include "object.h"
13     #include "cone.h"
14 greg 2.6 #include "plocate.h"
15 greg 1.1
16     #define ROOT3 1.732050808
17    
18     /*
19     * The algorithm used to detect cube intersection with cones is
20     * recursive. First, we approximate the cube to be a sphere. Then
21     * we test for cone intersection with the sphere by testing the
22     * segment of the cone which is nearest the sphere's center.
23     * If the cone has points within the cube's bounding sphere,
24     * we must check for intersection with the cube. This is done with
25     * the 3D line clipper. The same cone segment is used in this test.
26     * If the clip fails, we still cannot be sure there is no intersection,
27     * so we subdivide the cube and recurse.
28     * If none of the sub-cubes intersect, then our cube does not intersect.
29     */
30    
31     extern double mincusize; /* minimum cube size */
32    
33 greg 2.5 static int findcseg(FVECT ep0, FVECT ep1, CONE *co, FVECT p);
34 schorsch 2.3
35 greg 1.1
36 schorsch 2.3
37 schorsch 2.4 extern int
38     o_cone( /* determine if cone intersects cube */
39 schorsch 2.3 OBJREC *o,
40     register CUBE *cu
41     )
42 greg 1.1 {
43     CONE *co;
44     FVECT ep0, ep1;
45 schorsch 2.3 #ifdef STRICT
46 greg 1.1 FVECT cumin, cumax;
47     CUBE cukid;
48 schorsch 2.3 register int j;
49     #endif
50 greg 1.1 double r;
51     FVECT p;
52 schorsch 2.3 register int i;
53 greg 1.1 /* get cone arguments */
54     co = getcone(o, 0);
55     /* get cube center */
56     r = cu->cusize * 0.5;
57     for (i = 0; i < 3; i++)
58     p[i] = cu->cuorg[i] + r;
59     r *= ROOT3; /* bounding radius for cube */
60    
61 greg 2.5 if (findcseg(ep0, ep1, co, p)) {
62 greg 1.1 /* check min. distance to cone */
63     if (dist2lseg(p, ep0, ep1) > (r+FTINY)*(r+FTINY))
64 greg 1.2 return(O_MISS);
65 greg 1.1 #ifdef STRICT
66     /* get cube boundaries */
67     for (i = 0; i < 3; i++)
68     cumax[i] = (cumin[i] = cu->cuorg[i]) + cu->cusize;
69     /* closest segment intersects? */
70     if (clip(ep0, ep1, cumin, cumax))
71 greg 1.2 return(O_HIT);
72 greg 1.1 }
73     /* check sub-cubes */
74     cukid.cusize = cu->cusize * 0.5;
75     if (cukid.cusize < mincusize)
76 greg 1.2 return(O_HIT); /* cube too small */
77 greg 1.1 cukid.cutree = EMPTY;
78    
79     for (j = 0; j < 8; j++) {
80     for (i = 0; i < 3; i++) {
81     cukid.cuorg[i] = cu->cuorg[i];
82     if (1<<i & j)
83     cukid.cuorg[i] += cukid.cusize;
84     }
85     if (o_cone(o, &cukid))
86 greg 1.2 return(O_HIT); /* sub-cube intersects */
87 greg 1.1 }
88 greg 1.2 return(O_MISS); /* no intersection */
89 greg 1.1 #else
90     }
91 greg 1.2 return(O_HIT); /* assume intersection */
92 greg 1.1 #endif
93     }
94    
95    
96 greg 2.5 static int
97 schorsch 2.3 findcseg( /* find line segment from cone closest to p */
98     FVECT ep0,
99     FVECT ep1,
100     register CONE *co,
101     FVECT p
102     )
103 greg 1.1 {
104     double d;
105     FVECT v;
106     register int i;
107     /* find direction from axis to point */
108 greg 2.5 VSUB(v, p, CO_P0(co));
109 greg 1.1 d = DOT(v, co->ad);
110     for (i = 0; i < 3; i++)
111 greg 2.5 v[i] -= d*co->ad[i];
112     if (normalize(v) == 0.0)
113     return(0);
114     /* find endpoints of segment */
115     for (i = 0; i < 3; i++) {
116     ep0[i] = CO_R0(co)*v[i] + CO_P0(co)[i];
117     ep1[i] = CO_R1(co)*v[i] + CO_P1(co)[i];
118     }
119     return(1); /* return distance from axis */
120 greg 1.1 }