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

Comparing ray/src/hd/sm.h (file contents):
Revision 3.5 by gwlarson, Wed Nov 11 12:05:37 1998 UTC vs.
Revision 3.12 by greg, Fri Jun 20 00:25:49 2003 UTC

# Line 1 | Line 1
1 < /* Copyright (c) 1998 Silicon Graphics, Inc. */
2 <
3 < /* SCCSid "$SunId$ SGI" */
4 <
1 > /* RCSid: $Id$ */
2   /*
3   *  sm.h
4   */
5  
6   #ifndef _SM_H_
7   #define _SM_H_
11 –
8   #include "rhd_sample.h"
9 + #include "sm_qtree.h"
10 + #include "sm_stree.h"
11 + #define NEWSETS
12  
13  
14   #ifndef TRUE
# Line 17 | Line 16
16   #define FALSE 0
17   #endif
18  
19 < #define S_REPLACE_EPS 0.06        /* if (distance on sphere between sample
20 <                                     and a base point) < S_REPLACE_EPS,
21 <                                     replace base
22 <                                     */
19 >
20 > #define ON_V 1
21 > #define ON_P 2
22 > #define ON_E 3
23 > #define IN_T 4
24 >
25 > #ifdef SMLFLT
26 > #define VERT_EPS 2e-3 /* min edge length in radians */
27 > #define COS_VERT_EPS 0.999998 /* cos min edge length in radians */
28 > #define EDGE_EPS 2e-5 /* min distance until considered "on-edge"*/
29 > #define COLINEAR_EPS 1e-10 /* min sine of between edges angle :amount off PI */
30 > #else
31 > #define VERT_EPS 5e-4 /* min edge length in radians */
32 > #define COS_VERT_EPS 0.999999875 /* cos min edge length in radians */
33 > #define EDGE_EPS 2e-7 /* min distance until considered "on-edge"*/
34 > #define COLINEAR_EPS 1e-10 /* min sine of between edges angle :amount off PI*/
35 > #endif
36 >
37 > #define EV_EPS EDGE_EPS      /* Minimum edge-vertex distance */
38 >
39 >
40   #define S_REPLACE_SCALE (5.*5.)   /* if (distance to new point squared) is
41 <                                     > (triangle edge length squared*
42 <                                     S_REPLACE_SCALE):for all edges/triangle
43 <                                     vertices: new point is puncture
28 <                                     point: dont add
29 <                                   */
30 < #define S_REPLACE_TRI 2e-8              /* .052 radians to the sixth power */
41 >         > (triangle edge length squared*S_REPLACE_SCALE):for all edges/
42 >         triangle vertices: new point is puncture point: dont add*/
43 > #define S_REPLACE_TRI 2e-8              /* .052 radians to the sixth power */
44  
32 – #define SQRT3_2 0.8660254
45  
46 +
47   #define SM_DEFAULT 0
48 < #define SM_EXTRA_POINTS 8
49 < #define SM_EXTRA_VERTS  SM_EXTRA_POINTS
48 > #define SM_BASE_POINTS 162
49 > #define SM_BASE_TRIS 320
50 > #define SM_BASE_VERTS  SM_BASE_POINTS
51  
38 – #define SM_INC_PERCENT 0.60            /* If number of new triangles added
39 –                                          since last full redraw is >
40 –                                          (SM_INC_PERCENT * total triangles)
41 –                                          do full redraw instead of incremental
42 –                                          */
43 –
52   #define SM_VIEW_FRAC   0.1
53  
54 + #define  SM_ALL_LEVELS -1
55  
56 +
57   typedef int VERT;  /* One triangle that vertex belongs to- the rest
58                        are derived by traversing neighbors */
59  
60   typedef struct _EDGE {
61 <    int verts[2];
61 >    S_ID verts[2];
62      int tris[2];
63   } EDGE;
64  
# Line 58 | Line 68 | typedef struct _EDGE {
68   #define E_NTH_TRI(e,i)  ((e>0)?Edges[(e)].tris[(i)]:Edges[-(e)].tris[(1-i)])
69   #define SET_E_NTH_TRI(e,i,v) if(e>0) Edges[(e)].tris[(i)]=(v); \
70                                else Edges[-(e)].tris[(1-i)]=(v)
71 < #define eClear_edges() (Ecnt = 0)
71 > #define eClear_edges() (Ecnt = 0,free(Edges),Edges=NULL)
72  
73   #define FOR_ALL_EDGES(i) for((i)=1; (i) <= Ecnt; i++)
74 < #define FOR_ALL_EDGES_FROM(e,i) for((i)=++e; (i) <= Ecnt; i++)
74 > #define FOR_ALL_EDGES_FROM(e,i) for((i)=e+1; (i) <= Ecnt; i++)
75  
76  
77   typedef struct _TRI {
78 <  int verts[3];         /* Ids into sample and vertex array for each vertex*/
78 >  S_ID verts[3];         /* Ids into sample and vertex array for each vertex*/
79    int nbrs[3]; /* Ids for neighboring triangles: -1 if invalid */
80   }TRI;
81  
# Line 80 | Line 90 | typedef struct _TRI {
90   #define T_NEXT_FREE(t) ((t)->nbrs[0])
91   #define T_VALID_FLAG(t) ((t)->nbrs[1])
92   #define T_IS_VALID(t)  (T_VALID_FLAG(t)!=-1)
93 < #define T_FLAGS 3
93 > #define T_FLAGS 4
94  
95   typedef struct _SM {
96      FVECT view_center;    /* Canonical view center defining unit sphere */
# Line 88 | Line 98 | typedef struct _SM {
98      STREE locator;        /* spherical quadtree for point/triangle location */
99      int max_tris;         /* Maximum number of triangles */
100      int num_tri;          /* Current number of triangles */
91 –    int sample_tris;      /* Current number of non-base triangles*/
101      int free_tris;        /* pointer to free_list */
102      int max_verts;        /* Maximum number of vertices in the mesh */
103      TRI *tris;            /* Pointer to list of triangle structs */
104 <    VERT *verts;          /* List of vertices */
96 <    int4 *flags[T_FLAGS]; /* Bit 0 set if active(in current frustum) */
104 >    int32 *flags[T_FLAGS]; /* Bit 0 set if active(in current frustum) */
105                            /* Bit 1 set if not rendered since created */
106                            /* Bit 2 set if base triangle */
107   }SM;
# Line 101 | Line 109 | typedef struct _SM {
109   #define T_ACTIVE_FLAG   0
110   #define T_NEW_FLAG      1
111   #define T_BASE_FLAG     2
112 + #define T_BG_FLAG       3
113  
114   #define SM_VIEW_CENTER(m)             ((m)->view_center)
115   #define SM_SAMP(m)                    ((m)->samples)
116   #define SM_LOCATOR(m)                 (&((m)->locator))
117   #define SM_MAX_TRIS(m)                ((m)->max_tris)
118   #define SM_NUM_TRI(m)                 ((m)->num_tri)
110 – #define SM_SAMPLE_TRIS(m)                 ((m)->sample_tris)
119   #define SM_FREE_TRIS(m)               ((m)->free_tris)
120   #define SM_MAX_VERTS(m)               ((m)->max_verts)
121   #define SM_TRIS(m)                    ((m)->tris)
114 – #define SM_VERTS(m)                   ((m)->verts)
122   #define SM_NTH_FLAGS(m,n)             ((m)->flags[(n)])
123   #define SM_FLAGS(m)                   ((m)->flags)
124  
# Line 123 | Line 130 | typedef struct _SM {
130   #define SM_IS_NTH_T_ACTIVE(sm,n)     SM_IS_NTH_T_FLAG(sm,n,T_ACTIVE_FLAG)
131   #define SM_IS_NTH_T_BASE(sm,n)       SM_IS_NTH_T_FLAG(sm,n,T_BASE_FLAG)
132   #define SM_IS_NTH_T_NEW(sm,n)        SM_IS_NTH_T_FLAG(sm,n,T_NEW_FLAG)
133 + #define SM_IS_NTH_T_BG(sm,n)        SM_IS_NTH_T_FLAG(sm,n,T_BG_FLAG)
134  
135   #define SM_SET_NTH_T_ACTIVE(sm,n)    SM_SET_NTH_T_FLAG(sm,n,T_ACTIVE_FLAG)
136   #define SM_SET_NTH_T_BASE(sm,n)      SM_SET_NTH_T_FLAG(sm,n,T_BASE_FLAG)
137   #define SM_SET_NTH_T_NEW(sm,n)       SM_SET_NTH_T_FLAG(sm,n,T_NEW_FLAG)
138 + #define SM_SET_NTH_T_BG(sm,n)        SM_SET_NTH_T_FLAG(sm,n,T_BG_FLAG)
139  
140   #define SM_CLR_NTH_T_ACTIVE(sm,n)   SM_CLR_NTH_T_FLAG(sm,n,T_ACTIVE_FLAG)
141   #define SM_CLR_NTH_T_BASE(sm,n)     SM_CLR_NTH_T_FLAG(sm,n,T_BASE_FLAG)
142   #define SM_CLR_NTH_T_NEW(sm,n)      SM_CLR_NTH_T_FLAG(sm,n,T_NEW_FLAG)
143 + #define SM_CLR_NTH_T_BG(sm,n)       SM_CLR_NTH_T_FLAG(sm,n,T_BG_FLAG)
144  
145   #define SM_NTH_TRI(m,n)               (&(SM_TRIS(m)[(n)]))
146 < #define SM_NTH_VERT(m,n)              (SM_VERTS(m)[(n)])
146 > #define SM_NTH_VERT(m,n)              S_NTH_INFO(SM_SAMP(m),n)
147 >
148 > #define SM_T_ID_VALID(s,t_id) T_IS_VALID(SM_NTH_TRI(s,t_id))
149  
150 +
151   #define SM_MAX_SAMP(m)                S_MAX_SAMP(SM_SAMP(m))
152   #define SM_MAX_POINTS(m)              S_MAX_POINTS(SM_SAMP(m))
153   #define SM_SAMP_BASE(m)               S_BASE(SM_SAMP(m))
154   #define SM_NTH_WV(m,i)                S_NTH_W_PT(SM_SAMP(m),i)
155   #define SM_NTH_W_DIR(m,i)             S_NTH_W_DIR(SM_SAMP(m),i)
156 < #define SM_DIR_ID(m,i)                (SM_NTH_W_DIR(m,i)==-1)
156 > #define SM_DIR_ID(m,i)            (!SM_BASE_ID(m,i) && SM_NTH_W_DIR(m,i)==-1)
157   #define SM_NTH_RGB(m,i)               S_NTH_RGB(SM_SAMP(m),i)
158   #define SM_RGB(m)                    S_RGB(SM_SAMP(m))
159 + #define SM_WP(m)                    S_W_PT(SM_SAMP(m))
160   #define SM_BRT(m)                     S_BRT(SM_SAMP(m))
161   #define SM_NTH_BRT(m,i)               S_NTH_BRT(SM_SAMP(m),i)
162   #define SM_CHR(m)                     S_CHR(SM_SAMP(m))
# Line 152 | Line 166 | typedef struct _SM {
166  
167   #define SM_ALLOWED_VIEW_CHANGE(m) (SM_NUM_SAMP(m)/smDist_sum*SM_VIEW_FRAC)
168  
155 – #define SM_FOR_ALL_FLAGGED_TRIS(m,i,w,b) for(i=smNext_tri_flag_set(m,0,w,b); \
156 – i < SM_NUM_TRI(m); i=smNext_tri_flag_set(m,i+1,w,b))
157 –
158 – #define SM_FOR_ALL_ACTIVE_TRIS(m,i) SM_FOR_ALL_FLAGGED_TRIS(m,i,T_ACTIVE_FLAG,0)
159 – #define SM_FOR_ALL_NEW_TRIS(m,i) SM_FOR_ALL_FLAGGED_TRIS(m,i,T_NEW_FLAG,0)
160 – #define SM_FOR_ALL_BASE_TRIS(m,i) SM_FOR_ALL_FLAGGED_TRIS(m,i,T_BASE_FLAG,0)
161 – #define SM_FOR_ALL_VALID_TRIS(m,i) for(i=smNext_valid_tri(m,0); \
162 – i < SM_NUM_TRI(m); i=smNext_valid_tri(m,i+1))
163 –
164 – #define SM_FOR_ALL_ACTIVE_FG_TRIS(m,i) SM_FOR_ALL_FLAGGED_TRIS(m,i,T_ACTIVE_FLAG,1)
165 –
166 – #define SM_FOR_ALL_ACTIVE_BG_TRIS(m,i) SM_FOR_ALL_FLAGGED_TRIS(m,i,T_ACTIVE_FLAG,2)
167 –
168 –
169   #define SM_FOR_ALL_ADJACENT_TRIS(sm,id,t) for(t=smTri_next_ccw_nbr(sm,t,id); \
170   t!=SM_NTH_TRI(sm,SM_NTH_VERT(sm,id)); t=smTri_next_ccw_nbr(sm,t,id))
171  
# Line 187 | Line 187 | t!=SM_NTH_TRI(sm,SM_NTH_VERT(sm,id)); t=smTri_next_ccw
187  
188   #define SM_FOR_ALL_SAMPLES(sm,i) for((i)=0;i < SM_NUM_SAMP(sm);(i)++)
189  
190 < #define smInit_locator(sm,c)    (stInit(SM_LOCATOR(sm)), \
191 <                                 ST_SET_CENTER(SM_LOCATOR(sm),c))
192 < #define smClear_locator(sm)    stClear(SM_LOCATOR(sm))
190 > #define SM_FOR_ALL_VALID_TRIS(m,i) for((i)=0,(i)=smNext_valid_tri(m,i);(i)< \
191 > SM_NUM_TRI(m); (i)++,(i)= smNext_valid_tri(m,i))
192 >
193 > #define SM_FOR_ALL_FLAGGED_TRIS(m,i,w,b) for(i=0,i=smNext_tri_flag_set(m,i,w,b);i < SM_NUM_TRI(m);i++,i=smNext_tri_flag_set(m,i,w,b))
194 > #define SM_FOR_ALL_ACTIVE_TRIS(m,i) SM_FOR_ALL_FLAGGED_TRIS(m,i,T_ACTIVE_FLAG,0)
195 > #define smInit_locator(sm)    stInit(SM_LOCATOR(sm))
196   #define smAlloc_locator(sm)   stAlloc(SM_LOCATOR(sm))
197 < #define smFree_locator(sm)   stClear(SM_LOCATOR(sm))
195 < #define smPointLocateCell(sm,pt)  stPoint_locate(SM_LOCATOR(sm),pt)
197 > #define smFree_locator(sm)   stFree(SM_LOCATOR(sm))
198   #define smUnalloc_samp(sm,id)  sUnalloc_samp(SM_SAMP(sm),id)
199 + #define smPoint_locate_cell(sm,pt)  stPoint_locate(SM_LOCATOR(sm),pt)
200   #define smFree_samples(sm)     sFree(SM_SAMP(sm))
198 – #define smClear_samples(sm)    sClear(SM_SAMP(sm))
201   #define smInit_samples(sm)     sInit(SM_SAMP(sm))
202  
203 <
203 > #define SM_S_NTH_QT(sm,s_id)       S_NTH_INFO1(SM_SAMP(sm),s_id)
204   #define smClear_vert(sm,id)    (SM_NTH_VERT(sm,id) = INVALID)
205  
206 < #define SQRT3_INV 0.5773502692
206 > #define freebuf(b)  tempbuf(-1)
207  
206 – typedef struct _T_DEPTH {
207 –  int tri;
208 –  double depth;
209 – }T_DEPTH;
210 –
208   typedef struct _RT_ARGS_{
209    FVECT orig,dir;
210    int t_id;
211 <  OBJECT *os;
211 >  S_ID *os;
212   }RT_ARGS;
213  
214 + typedef struct _S_ARGS_{
215 +  S_ID s_id;
216 +  S_ID n_id;
217 + }S_ARGS;
218  
219 +
220   typedef struct _ADD_ARGS {
221    int t_id;
222 <  OBJECT *del_set;
222 >  S_ID *del_set;
223   }ADD_ARGS;
224  
225   extern SM *smMesh;
224 – extern int smNew_tri_cnt;
226   extern double smDist_sum;
227  
228  
# Line 263 | Line 264 | extern FVECT FrustumNear[4],FrustumFar[4];
264   *
265   * Find the closest sample to the given ray.  Return -1 on failure.
266   *
266 – *
267 – * smClean()            : display has been wiped clean
268 – *
269 – * Called after display has been effectively cleared, meaning that all
270 – * geometry must be resent down the pipeline in the next call to smUpdate().
271 – *
272 – *
273 – * smUpdate(vp, qua)    : update OpenGL output geometry for view vp
274 – * VIEW *vp;            : desired view
275 – * int  qua;            : quality level (percentage on linear time scale)
276 – *
277 – * Draw new geometric representation using OpenGL calls.  Assume that the
278 – * view has already been set up and the correct frame buffer has been
279 – * selected for drawing.  The quality level is on a linear scale, where 100%
280 – * is full (final) quality.  It is not necessary to redraw geometry that has
281 – * been output since the last call to smClean().  (The last view drawn will
282 – * be vp==&odev.v each time.)
267   */
284 –
268   #endif
269  
270  

Diff Legend

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