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

Comparing ray/src/hd/sm_geom.h (file contents):
Revision 3.2 by gwlarson, Thu Aug 20 16:47:22 1998 UTC vs.
Revision 3.13 by schorsch, Mon Jul 14 22:24:00 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_geom.h
4   */
5  
6   /* Assumes included after standard.h  */
7 + #ifndef _RAD_SM_GEOM_H_
8 + #define _RAD_SM_GEOM_H_
9  
10 + #include <values.h>
11 +
12 + #ifdef __cplusplus
13 + extern "C" {
14 + #endif
15 +
16 + #ifdef SMLFLT
17 + #define EQUALITY_EPS 1e-6
18 + #else
19 + #define EQUALITY_EPS 1e-10
20 + #endif
21 +
22 + #define F_TINY 1e-10
23 + #define FZERO(x) ((x) < F_TINY && (x) > -F_TINY)
24 + #define FEQUAL(a,b) FZERO((a) - (b))
25 +
26   #define ZERO(x) ((x) < FTINY && (x) > -FTINY)
27   #define EQUAL(a,b) ZERO((a) - (b))
28  
# Line 16 | Line 31
31   #define FALSE 0
32   #endif
33  
34 + typedef struct _FPEQ {
35 +    FVECT n;
36 +    double d;
37 +    char x,y,z;
38 + }FPEQ;
39 +
40 + #define FP_N(f) ((f).n)
41 + #define FP_D(f) ((f).d)
42 + #define FP_X(f) ((f).x)
43 + #define FP_Y(f) ((f).y)
44 + #define FP_Z(f) ((f).z)
45 +  
46 + typedef long BCOORD;
47 + typedef long BDIR;
48 +
49 + #define BITS_BCOORD     (BITS(long)-2)
50 + #define SHIFT_MAXBCOORD (BITS_BCOORD-1)  
51 + #define MAXBCOORD      ((1L << BITS_BCOORD)-1)
52 + #define MAXBCOORD2      (MAXBCOORD>>1)
53 + #define MAXBCOORD4      (MAXBCOORD2>>1)
54 +
55   #define M_2_3_PI PI*2/3
56  
57 < #define GT_INVALID  0
58 < #define GT_VERTEX   1
59 < #define GT_EDGE     2
60 < #define GT_FACE     4
61 < #define GT_INTERIOR 8
62 < #define GT_INTERSECT 16
63 < #define GT_ADJACENT  32
28 < #define GT_OUT       64
57 > #ifndef INVALID
58 > #define INVALID -1
59 > #endif
60 > #define IADDV3(v,a)  ((v)[0] += (a)[0],(v)[1] += (a)[1],(v)[2] += (a)[2])
61 > #define ISUBV3(v,a)  ((v)[0] -= (a)[0],(v)[1] -= (a)[1],(v)[2] -= (a)[2])
62 > #define ISCALEV3(v,a)  ((v)[0] *= (a),(v)[1] *= (a),(v)[2] *= (a))
63 > #define IDIVV3(v,a)  ((v)[0] /= (a),(v)[1] /= (a),(v)[2] /= (a))
64  
65 +
66 + #define ADDV3(v,a,b) ((v)[0] = (a)[0]+(b)[0],(v)[1] = (a)[1]+(b)[1],\
67 +                      (v)[2] = (a)[2]+(b)[2])
68 + #define SUBV3(v,a,b) ((v)[0] = (a)[0]-(b)[0],(v)[1] = (a)[1]-(b)[1],\
69 +                      (v)[2] = (a)[2]-(b)[2])
70 + #define SUMV3(v,a,b,s) ((v)[0] = (a)[0]+(s)*(b)[0],(v)[1]=(a)[1]+(s)*(b)[1],\
71 +                      (v)[2] = (a)[2]+(s)*(b)[2])
72 + #define SCALEV3(v,a,s)  ((v)[0]=(a)[0]*(s),(v)[1]=(a)[1]*(s),(v)[2]=(a)[2]*(s))
73   #define ZERO_VEC3(v)     (ZERO(v[0]) && ZERO(v[1]) && ZERO(v[2]) )
74 < #define EQUAL_VEC3(a,b)  (EQUAL(a[0],b[0])&&EQUAL(a[1],b[1])&&EQUAL(a[2],b[2]))
74 > #define EQUAL_VEC3(a,b)  (FEQUAL(a[0],b[0])&&FEQUAL(a[1],b[1])&&FEQUAL(a[2],b[2]))
75 > #define OPP_EQUAL_VEC3(a,b)  (EQUAL(a[0],-b[0])&&EQUAL(a[1],-b[1])&&EQUAL(a[2],-b[2]))
76 > #define FZERO_VEC3(v)     (FZERO(v[0]) && FZERO(v[1]) && FZERO(v[2]) )
77 > #define FEQUAL_VEC3(a,b) (FEQUAL(a[0],b[0])&&FEQUAL(a[1],b[1])&&FEQUAL(a[2],b[2]))
78   #define NEGATE_VEC3(v)   ((v)[0] *= -1.0,(v)[1] *= -1.0,(v)[2] *= -1.0)
79   #define COPY_VEC2(v1,v2) ((v1)[0]=(v2)[0],(v1)[1]=(v2)[1])
80   #define DIST(a,b)         (sqrt(((a)[0]-(b)[0])*((a)[0]-(b)[0]) + \
81                                  ((a)[1]-(b)[1])*((a)[1]-(b)[1]) + \
82                                  ((a)[2]-(b)[2])*((a)[2]-(b)[2])))
83 + #define DIST_SQ(a,b)      (((a)[0]-(b)[0])*((a)[0]-(b)[0]) + \
84 +                                ((a)[1]-(b)[1])*((a)[1]-(b)[1]) + \
85 +                                ((a)[2]-(b)[2])*((a)[2]-(b)[2]))
86  
87 + #define SIGN(x) ((x<0)?-1:1)
88   #define CROSS_VEC2(v1,v2) (((v1)[0]*(v2)[1]) - ((v1)[1]*(v2)[0]))
89   #define DOT_VEC2(v1,v2) ((v1)[0]*(v2)[0] + (v1)[1]*(v2)[1])
90  
91 < #define EDGE_MIDPOINT_VEC3(a,v1,v2) ((a)[0]=((v1)[0]+(v2)[0])*0.5, \
91 > #define EDGE_MIDPOINT(a,v1,v2) ((a)[0]=((v1)[0]+(v2)[0])*0.5, \
92   (a)[1]=((v1)[1]+(v2)[1])*0.5,(a)[2] = ((v1)[2]+(v2)[2])*0.5)
93  
94   #define MIN_VEC3(v) ((v)[0]<(v)[1]?((v)[0]<(v)[2]?(v)[0]:v[2]): \
95                       (v)[1]<(v)[2]?(v)[1]:(v)[2])
96 <  
96 > #define MAX3(a,b,c) (((b)>(a))?((b) > (c))?(b):(c):((a)>(c))?(a):(c))  
97 > #define MIN3(a,b,c) (((b)<(a))?((b) < (c))?(b):(c):((a)<(c))?(a):(c))
98  
99 + #define MAX(a,b)    (((b)>(a))?(b):(a))  
100 + #define MIN(a,b)  (((b)<(a))?(b):(a))  
101 +
102   #define SUM_3VEC3(r,a,b,c) ((r)[0]=(a)[0]+(b)[0]+(c)[0], \
103     (r)[1]=(a)[1]+(b)[1]+(c)[1],(r)[2]=(a)[2]+(b)[2]+(c)[2])
104  
105   #define NTH_BIT(n,i)         ((n) & (1<<(i)))
106   #define SET_NTH_BIT(n,i)     ((n) |= (1<<(i)))  
107  
108 + #define PT_ON_PLANE(p,peq) (DOT(FP_N(peq),p)+FP_D(peq))
109  
110 < /* int convex_angle(FVECT v0,FVECT v1,FVECT v2) */
111 < /* void triangle_centroid(FVECT v0,FVECT v1,FVECT v2,FVECT c) */
112 < /* void triangle_plane_equation(FVECT v0,FVECT v1,FVECT v2,FVECT n,double *nd,
113 <        char norm) */
114 < /* int vec3_equal(FVECT v1,v2) */
115 < /* int point_relative_to_plane(FVECT p,FVECT n, double nd) */
116 < /* int point_in_circle(FVECT p,FVECT p0,FVECT p1) */
117 < /* int intersect_line_plane(FVECT r,FVECT p1,FVECT p2,float *plane) */
118 < /* int point_in_cone(FVECT p,FVECT p1,FVECT p2,FVECT p3,FVECT p4) */  
119 < /* void point_on_sphere(FVECT ps,FVECT p,FVECT c) */
120 < /* int test_point_against_spherical_tri(FVECT v0,FVECT v1,FVECT v2,FVECT p,
121 <       FVECT n,char *nset,char *which,char sides[3]) */
122 < /* int test_single_point_against_spherical_tri(FVECT v0,FVECT v1,FVECT v2,
68 <       FVECT p,char *which )*/
69 < /* int test_vertices_for_tri_inclusion(FVECT tri[3],FVECT pts[3],char *nset,
70 <       FVECT n[3],FVECT avg,char pt_sides[3][3]); */
71 < /* void set_sidedness_tests(FVECT tri[3],FVECT pts[3],char test[3],
72 <        char sides[3][3],char nset,FVECT n[3])
73 < */
74 < /* int cs_spherical_edge_edge_test(FVECT n[2][3],int i,int j,FVECT avg[2]) */
75 < /* int spherical_tri_tri_intersect(FVECT a1,FVECT a2,FVECT a3,
76 <                                 FVECT b1,FVECT b2,FVECT b3) */
77 <  
78 < /* void calculate_view_frustum(FVECT vp,hv,vv,double horiz,vert,near,far,
79 <   FVECT fnear[4],FVECT ffar[4])
80 < */
81 < /* double triangle_normal_Newell(FVECT v0,FVECT v1,FVECT v2,FVECT n,char n)*/
110 > /* FUNCTIONS:
111 >   int point_in_cone(FVECT p,a,b,c)
112 >   void triangle_centroid(FVECT v0,v1,v2,c)
113 >   double tri_normal(FVECT v0,v1,v2,n,int norm)
114 >   void tri_plane_equation(FVECT v0,v1,v2,FPEQ *peqptr,int norm)
115 >   int intersect_ray_plane(FVECT orig,dir,FPEQ peq,double *pd,FVECT r)
116 >   double point_on_sphere(FVECT ps,p,c)
117 >   int point_in_stri(FVECT v0,v1,v2,p)
118 >   int ray_intersect_tri(FVECT orig,dir,v0,v1,v2,pt)
119 >   void calculate_view_frustum(FVECT vp,hv,vv,double horiz,vert,near,far,
120 >                               FVECT fnear[4],ffar[4])
121 >   void bary2d(double x1,y1,x2,y2,x3,y3,px,py,coord)
122 > */
123   double tri_normal();
124 < /* double spherical_edge_normal(FVECT v0,FVECT v1,FVECT n,char norm) */
84 < double spherical_edge_normal();
124 > double point_on_sphere();
125  
126 +
127 + #ifdef __cplusplus
128 + }
129 + #endif
130 + #endif /* _RAD_SM_GEOM_H_ */
131  

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines