ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/hd/sm_qtree.h
(Generate patch)

Comparing ray/src/hd/sm_qtree.h (file contents):
Revision 3.2 by gwlarson, Thu Aug 20 16:47:22 1998 UTC vs.
Revision 3.9 by gwlarson, Mon Dec 28 18:07:36 1998 UTC

# Line 19 | Line 19
19   *
20   *              < -1:   it is an index to a set of objects
21   */
22 + #include "object.h"
23 + typedef struct _FUNC {
24 +    int (*func)();
25 +    int *argptr;
26 + }FUNC;
27  
28 + #define F_FUNC(f) (f.func)
29 + #define F_ARGS(f) (f.argptr)
30   #define  QUADTREE               int
31  
32   #define  EMPTY          (-1)
33  
34   #define  QT_IS_EMPTY(qt)        ((qt) == EMPTY)
35 < #define  QT_IS_LEAF(qt) ((qt) < EMPTY)
36 < #define  QT_IS_TREE(qt) ((qt) > EMPTY)
35 > #define  QT_IS_LEAF(qt)         ((qt) < EMPTY)
36 > #define  QT_IS_TREE(qt)         ((qt) > EMPTY)
37  
38 < #define  QT_INDEX(qt)          (-(qt)-2)        /* quadtree node from set */
39 < #define  QT_SET_INDEX(i)       (-((i)+2))       /* object set from node */
40 < #define  QT_BLOCK(qt)         ((qt)>>8)         /* quadtree block index */
41 < #define  QT_BLOCK_INDEX(qt)   (((qt)&0377)<<2)  /* quadtree index in block */
38 > #define  QT_INDEX(qt)           (-(qt)-2)       /* quadtree node from set */
39 > #define  QT_SET_INDEX(i)        (-((i)+2))      /* object set from node */
40 > #define  QT_BLOCK_SIZE          1024            /* quadtrees in block */
41 > #define  QT_BLOCK(qt)           ((qt)>>10)      /* quadtree block index */
42 > #define  QT_BLOCK_INDEX(qt)   (((qt)&0x3ff)<<2) /* quadtree index in block */
43  
44 +
45   #ifndef  QT_MAX_BLK
46   #ifdef  BIGMEM
47 < #define  QT_MAX_BLK     65535           /* maximum quadtree block */
47 > #define  QT_MAX_BLK     16383           /* maximum quadtree block */
48   #else
49 < #define  QT_MAX_BLK     8191            /* maximum quadtree block */
49 > #define  QT_MAX_BLK     2047            /* maximum quadtree block */
50   #endif
51   #endif
52  
53  
45 –
54   #define  QT_NTH_CHILD(qt,br) (quad_block[QT_BLOCK(qt)][QT_BLOCK_INDEX(qt)+br])
55 < #define  QT_NTH_CHILD_PTR(qt,br) \
56 <                    (&(quad_block[QT_BLOCK(qt)][QT_BLOCK_INDEX(qt)+br]))
57 < #define  QT_CLEAR_CHILDREN(qt) (QT_NTH_CHILD(qt,0)=EMPTY, \
50 < QT_NTH_CHILD(qt,1)=EMPTY,QT_NTH_CHILD(qt,2)=EMPTY,QT_NTH_CHILD(qt,3)=EMPTY)
55 > #define  QT_NTH_CHILD_PTR(qt,br) (&QT_NTH_CHILD(qt,br))
56 > #define  QT_CLEAR_CHILDREN(qt) (QT_NTH_CHILD(qt,0)=QT_NTH_CHILD(qt,1)= \
57 >                        QT_NTH_CHILD(qt,2)=QT_NTH_CHILD(qt,3)=EMPTY)
58  
59  
60 < #if 0
61 < #define  QT_EMPTY       0
62 < #define  QT_FULL        1
63 < #define  QT_TREE        2
64 < #endif
60 > /* QUADTREE NODE FLAGS */
61 > #define QT_IS_FLAG(qt)          IS_FLAG(quad_flag,qt)
62 > #define QT_SET_FLAG(qt)         SET_FLAG(quad_flag,qt)
63 > #define QT_CLR_FLAG(qt)         CLR_FLAG(quad_flag,qt)
64 > #define QT_LEAF_IS_FLAG(qt)     IS_FLAG(qtsetflag,QT_INDEX(qt))
65 > #define QT_LEAF_SET_FLAG(qt)    SET_FLAG(qtsetflag,QT_INDEX(qt))
66 > #define QT_LEAF_CLR_FLAG(qt)    CLR_FLAG(qtsetflag,QT_INDEX(qt))
67  
59 –
60 –
68   /* OBJECT SET CODE */
69   #define QT_SET_CNT(s)          ((s)[0])
70   #define QT_SET_NTH_ELEM(s,n)   ((s)[(n)])  
# Line 67 | Line 74 | QT_NTH_CHILD(qt,1)=EMPTY,QT_NTH_CHILD(qt,2)=EMPTY,QT_N
74   #define QT_SET_PTR(s)          (&((s)[1]))
75  
76  
77 < #define QT_MAX_SET        MAXSET
78 < #define MAXCSET           MAXSET*2
77 > #define QT_MAXSET        511
78 > #define MAXCSET          2*QT_MAXSET
79 > #define QT_MAXCSET       MAXCSET
80   #ifndef QT_SET_THRESHOLD
81 < #define QT_SET_THRESHOLD  30  
81 > #define QT_SET_THRESHOLD 64  
82   #endif
83  
84   #ifndef QT_MAX_LEVELS
85 < #define QT_MAX_LEVELS     17
85 > #define QT_MAX_LEVELS     10
86   #endif
87  
88 < #define QT_BLOCK_SIZE 256
88 > #define QT_FILL_THRESHOLD 2
89 > #define QT_EXPAND   8
90 > #define QT_COMPRESS 16
91 > #define QT_DONE 32
92 > #define QT_MODIFIED 64
93  
94 + #define QT_FLAG_FILL_TRI(f)  (((f)&0x7) == QT_FILL_THRESHOLD)
95 + #define QT_FLAG_UPDATE(f)    ((f)& (QT_EXPAND | QT_COMPRESS))
96 + #define QT_FLAG_IS_DONE(f)   ((f)& QT_DONE)
97 + #define QT_FLAG_SET_DONE(f)   ((f) |= QT_DONE)
98 + #define QT_FLAG_IS_MODIFIED(f)   ((f)& QT_MODIFIED)
99 + #define QT_FLAG_SET_MODIFIED(f)   ((f) |= QT_MODIFIED)
100 +
101 + #define qtSubdivide(qt) (qt = qtAlloc(),QT_CLEAR_CHILDREN(qt))
102 + #define qtSubdivide_tri(v0,v1,v2,a,b,c) (EDGE_MIDPOINT(a,v0,v1), \
103 +                                         EDGE_MIDPOINT(b,v1,v2), \
104 +                                         EDGE_MIDPOINT(c,v2,v0))
105 +
106   extern QUADTREE  qtnewleaf(), qtaddelem(), qtdelelem();
107  
108   extern QUADTREE  *quad_block[QT_MAX_BLK];       /* quadtree blocks */
109 + extern int4  *quad_flag;                        /* zeroeth quadtree flag */
110 +
111 + extern OBJECT   **qtsettab;             /* quadtree leaf node table */
112 + extern QUADTREE  qtnumsets;             /* number of used set indices */
113 + extern int4   *qtsetflag;
114 + #ifdef DEBUG
115 + extern OBJECT   *qtqueryset();
116 + #else
117 + #define qtqueryset(qt)  (qtsettab[QT_SET_INDEX(qt)])
118 + #endif
119 +
120 + #define qtinset(qt,id)  inset(qtqueryset(qt),id)
121 + #define qtgetset(os,qt) setcopy(os,qtqueryset(qt))
122 +
123 +
124 + #define SIDES_GTR(b0,b1,b2,s0,s1,s2,a,b,c) \
125 +    (s0 = ((b0[0] > a?4:0) | (b1[0] > a?2:0) | (b2[0] > a?1:0)), \
126 +     s1 = ((b0[1] > b?4:0) | (b1[1] > b?2:0) | (b2[1] > b?1:0)), \
127 +     s2 = ((b0[2] > c?4:0) | (b1[2] > c?2:0) | (b2[2] > c?1:0)))
128 +
129 + #define SIDES_LESS(b0,b1,b2,s0,s1,s2,a,b,c) \
130 +    (s0 = ((b0[0] < a?4:0) | (b1[0] < a?2:0) | (b2[0] < a?1:0)), \
131 +     s1 = ((b0[1] < b?4:0) | (b1[1] < b?2:0) | (b2[1] < b?1:0)), \
132 +     s2 = ((b0[2] < c?4:0) | (b1[2] < c?2:0) | (b2[2] < c?1:0)))
133 +
134 + /*
135 + QUADTREE qtRoot_point_locate(qt,q0,q1,q2,peq,pt,r0,r1,r2)
136 +   QUADTREE qt;
137 +   FVECT q0,q1,q2;
138 +   FPEQ peq;
139 +   FVECT pt;
140 +   FVECT r0,r1,r2;
141 +
142 +   Return the quadtree node containing pt. It is assumed that pt is in
143 +   the root node qt with ws vertices q0,q1,q2 and plane equation peq.
144 +   If r0 != NULL will return coordinates of node in (r0,r1,r2).
145 + */
146 +
147 + extern QUADTREE qtRoot_point_locate();
148 + extern QUADTREE qtRoot_add_tri();
149 + extern QUADTREE qtRoot_remove_tri();
150 + extern QUADTREE qtAdd_tri();
151 + extern QUADTREE qtRoot_visit_tri_edges();
152 + extern QUADTREE qtRoot_trace_ray();

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines