ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/radiance/ray/src/hd/sm_geom.h
Revision: 3.7
Committed: Mon Dec 28 18:07:35 1998 UTC (25 years, 4 months ago) by gwlarson
Content type: text/plain
Branch: MAIN
Changes since 3.6: +12 -10 lines
Log Message: 
New insertion routine
New Culling routine based on insertion algorithm
Adapted old insertion code: now used by picking
Point location code returns on-vertex,on-edge, or in-triangle
Added on_edge case for subdivision
Implemented unordered sets
Removed deletion from quadtree- added set compression to replace functionality

File Contents

# User Rev Content
1 gwlarson 3.1 /* Copyright (c) 1998 Silicon Graphics, Inc. */
2    
3     /* SCCSid "$SunId$ SGI" */
4    
5     /*
6     * sm_geom.h
7     */
8    
9     /* Assumes included after standard.h */
10    
11 gwlarson 3.4 #include <values.h>
12    
13 gwlarson 3.7 #define F_TINY 1e-5
14 gwlarson 3.6 #define FZERO(x) ((x) < F_TINY && (x) > -F_TINY)
15     #define FEQUAL(a,b) FZERO((a) - (b))
16    
17 gwlarson 3.1 #define ZERO(x) ((x) < FTINY && (x) > -FTINY)
18     #define EQUAL(a,b) ZERO((a) - (b))
19    
20     #ifndef TRUE
21     #define TRUE 1
22     #define FALSE 0
23     #endif
24 gwlarson 3.4
25 gwlarson 3.5 typedef struct _FPEQ {
26     FVECT n;
27     double d;
28     char x,y,z;
29     }FPEQ;
30    
31     #define FP_N(f) ((f).n)
32     #define FP_D(f) ((f).d)
33     #define FP_X(f) ((f).x)
34     #define FP_Y(f) ((f).y)
35     #define FP_Z(f) ((f).z)
36    
37 gwlarson 3.4 typedef long BCOORD;
38     typedef long BDIR;
39     typedef long TINT;
40 gwlarson 3.7
41     #define BITS_BCOORD (BITS(long)-2)
42     #define SHIFT_MAXBCOORD (BITS_BCOORD-1)
43     #define MAXBCOORD ((1L << BITS_BCOORD)-1)
44 gwlarson 3.4 #define MAXBCOORD2 (MAXBCOORD>>1)
45 gwlarson 3.7 #define MAXBCOORD4 (MAXBCOORD2>>1)
46 gwlarson 3.1
47     #define M_2_3_PI PI*2/3
48    
49 gwlarson 3.5 #ifndef INVALID
50 gwlarson 3.3 #define INVALID -1
51 gwlarson 3.5 #endif
52 gwlarson 3.3
53 gwlarson 3.1 #define GT_INVALID 0
54     #define GT_VERTEX 1
55     #define GT_EDGE 2
56     #define GT_FACE 4
57     #define GT_INTERIOR 8
58     #define GT_INTERSECT 16
59     #define GT_ADJACENT 32
60     #define GT_OUT 64
61    
62     #define ZERO_VEC3(v) (ZERO(v[0]) && ZERO(v[1]) && ZERO(v[2]) )
63     #define EQUAL_VEC3(a,b) (EQUAL(a[0],b[0])&&EQUAL(a[1],b[1])&&EQUAL(a[2],b[2]))
64 gwlarson 3.7 #define OPP_EQUAL_VEC3(a,b) (EQUAL(a[0],-b[0])&&EQUAL(a[1],-b[1])&&EQUAL(a[2],-b[2]))
65 gwlarson 3.6 #define FZERO_VEC3(v) (FZERO(v[0]) && FZERO(v[1]) && FZERO(v[2]) )
66     #define FEQUAL_VEC3(a,b) (FEQUAL(a[0],b[0])&&FEQUAL(a[1],b[1])&&FEQUAL(a[2],b[2]))
67 gwlarson 3.1 #define NEGATE_VEC3(v) ((v)[0] *= -1.0,(v)[1] *= -1.0,(v)[2] *= -1.0)
68     #define COPY_VEC2(v1,v2) ((v1)[0]=(v2)[0],(v1)[1]=(v2)[1])
69     #define DIST(a,b) (sqrt(((a)[0]-(b)[0])*((a)[0]-(b)[0]) + \
70     ((a)[1]-(b)[1])*((a)[1]-(b)[1]) + \
71     ((a)[2]-(b)[2])*((a)[2]-(b)[2])))
72 gwlarson 3.3 #define DIST_SQ(a,b) (((a)[0]-(b)[0])*((a)[0]-(b)[0]) + \
73     ((a)[1]-(b)[1])*((a)[1]-(b)[1]) + \
74     ((a)[2]-(b)[2])*((a)[2]-(b)[2]))
75 gwlarson 3.1
76 gwlarson 3.7 #define SIGN(x) ((x<0)?-1:1)
77 gwlarson 3.1 #define CROSS_VEC2(v1,v2) (((v1)[0]*(v2)[1]) - ((v1)[1]*(v2)[0]))
78     #define DOT_VEC2(v1,v2) ((v1)[0]*(v2)[0] + (v1)[1]*(v2)[1])
79    
80 gwlarson 3.7 #define EDGE_MIDPOINT(a,v1,v2) ((a)[0]=((v1)[0]+(v2)[0])*0.5, \
81 gwlarson 3.1 (a)[1]=((v1)[1]+(v2)[1])*0.5,(a)[2] = ((v1)[2]+(v2)[2])*0.5)
82    
83     #define MIN_VEC3(v) ((v)[0]<(v)[1]?((v)[0]<(v)[2]?(v)[0]:v[2]): \
84     (v)[1]<(v)[2]?(v)[1]:(v)[2])
85 gwlarson 3.5 #define MAX3(a,b,c) (((b)>(a))?((b) > (c))?(b):(c):((a)>(c))?(a):(c))
86     #define MIN3(a,b,c) (((b)<(a))?((b) < (c))?(b):(c):((a)<(c))?(a):(c))
87     #define MAX(a,b) (((b)>(a))?(b):(a))
88     #define MIN(a,b) (((b)<(a))?(b):(a))
89 gwlarson 3.2
90 gwlarson 3.1 #define SUM_3VEC3(r,a,b,c) ((r)[0]=(a)[0]+(b)[0]+(c)[0], \
91     (r)[1]=(a)[1]+(b)[1]+(c)[1],(r)[2]=(a)[2]+(b)[2]+(c)[2])
92    
93     #define NTH_BIT(n,i) ((n) & (1<<(i)))
94     #define SET_NTH_BIT(n,i) ((n) |= (1<<(i)))
95    
96    
97     /* int convex_angle(FVECT v0,FVECT v1,FVECT v2) */
98     /* void triangle_centroid(FVECT v0,FVECT v1,FVECT v2,FVECT c) */
99     /* void triangle_plane_equation(FVECT v0,FVECT v1,FVECT v2,FVECT n,double *nd,
100     char norm) */
101     /* int vec3_equal(FVECT v1,v2) */
102     /* int point_relative_to_plane(FVECT p,FVECT n, double nd) */
103     /* int point_in_circle(FVECT p,FVECT p0,FVECT p1) */
104     /* int intersect_line_plane(FVECT r,FVECT p1,FVECT p2,float *plane) */
105     /* int point_in_cone(FVECT p,FVECT p1,FVECT p2,FVECT p3,FVECT p4) */
106     /* void point_on_sphere(FVECT ps,FVECT p,FVECT c) */
107     /* int test_point_against_spherical_tri(FVECT v0,FVECT v1,FVECT v2,FVECT p,
108     FVECT n,char *nset,char *which,char sides[3]) */
109     /* int test_single_point_against_spherical_tri(FVECT v0,FVECT v1,FVECT v2,
110     FVECT p,char *which )*/
111     /* int test_vertices_for_tri_inclusion(FVECT tri[3],FVECT pts[3],char *nset,
112     FVECT n[3],FVECT avg,char pt_sides[3][3]); */
113     /* void set_sidedness_tests(FVECT tri[3],FVECT pts[3],char test[3],
114     char sides[3][3],char nset,FVECT n[3])
115     */
116     /* int cs_spherical_edge_edge_test(FVECT n[2][3],int i,int j,FVECT avg[2]) */
117     /* int spherical_tri_tri_intersect(FVECT a1,FVECT a2,FVECT a3,
118     FVECT b1,FVECT b2,FVECT b3) */
119    
120     /* void calculate_view_frustum(FVECT vp,hv,vv,double horiz,vert,near,far,
121     FVECT fnear[4],FVECT ffar[4])
122     */
123     /* double triangle_normal_Newell(FVECT v0,FVECT v1,FVECT v2,FVECT n,char n)*/
124     double tri_normal();
125     /* double spherical_edge_normal(FVECT v0,FVECT v1,FVECT n,char norm) */
126     double spherical_edge_normal();
127 gwlarson 3.7 double point_on_sphere();
128 gwlarson 3.1
129 gwlarson 3.5 #define point_in_stri_n(n0,n1,n2,p) \
130 gwlarson 3.7 ((DOT(n0,p)<=FTINY)&&(DOT(n1,p)<=FTINY)&&(DOT(n2,p)<=FTINY))
131 gwlarson 3.1
132 gwlarson 3.5 #define PT_ON_PLANE(p,peq) (DOT(FP_N(peq),p)+FP_D(peq))
133 gwlarson 3.7