1 |
greg |
3.12 |
/* RCSid: $Id$ */ |
2 |
gwlarson |
3.1 |
/* |
3 |
|
|
* sm_geom.h |
4 |
|
|
*/ |
5 |
|
|
|
6 |
|
|
/* Assumes included after standard.h */ |
7 |
|
|
|
8 |
gwlarson |
3.4 |
#include <values.h> |
9 |
|
|
|
10 |
greg |
3.12 |
#ifdef SMLFLT |
11 |
|
|
#define EQUALITY_EPS 1e-6 |
12 |
|
|
#else |
13 |
|
|
#define EQUALITY_EPS 1e-10 |
14 |
|
|
#endif |
15 |
|
|
|
16 |
gwlarson |
3.11 |
#define F_TINY 1e-10 |
17 |
gwlarson |
3.6 |
#define FZERO(x) ((x) < F_TINY && (x) > -F_TINY) |
18 |
|
|
#define FEQUAL(a,b) FZERO((a) - (b)) |
19 |
|
|
|
20 |
gwlarson |
3.1 |
#define ZERO(x) ((x) < FTINY && (x) > -FTINY) |
21 |
|
|
#define EQUAL(a,b) ZERO((a) - (b)) |
22 |
|
|
|
23 |
|
|
#ifndef TRUE |
24 |
|
|
#define TRUE 1 |
25 |
|
|
#define FALSE 0 |
26 |
|
|
#endif |
27 |
gwlarson |
3.4 |
|
28 |
gwlarson |
3.5 |
typedef struct _FPEQ { |
29 |
|
|
FVECT n; |
30 |
|
|
double d; |
31 |
|
|
char x,y,z; |
32 |
|
|
}FPEQ; |
33 |
|
|
|
34 |
|
|
#define FP_N(f) ((f).n) |
35 |
|
|
#define FP_D(f) ((f).d) |
36 |
|
|
#define FP_X(f) ((f).x) |
37 |
|
|
#define FP_Y(f) ((f).y) |
38 |
|
|
#define FP_Z(f) ((f).z) |
39 |
|
|
|
40 |
gwlarson |
3.4 |
typedef long BCOORD; |
41 |
|
|
typedef long BDIR; |
42 |
gwlarson |
3.7 |
|
43 |
|
|
#define BITS_BCOORD (BITS(long)-2) |
44 |
|
|
#define SHIFT_MAXBCOORD (BITS_BCOORD-1) |
45 |
|
|
#define MAXBCOORD ((1L << BITS_BCOORD)-1) |
46 |
gwlarson |
3.4 |
#define MAXBCOORD2 (MAXBCOORD>>1) |
47 |
gwlarson |
3.7 |
#define MAXBCOORD4 (MAXBCOORD2>>1) |
48 |
gwlarson |
3.1 |
|
49 |
|
|
#define M_2_3_PI PI*2/3 |
50 |
|
|
|
51 |
gwlarson |
3.5 |
#ifndef INVALID |
52 |
gwlarson |
3.3 |
#define INVALID -1 |
53 |
gwlarson |
3.5 |
#endif |
54 |
gwlarson |
3.10 |
#define IADDV3(v,a) ((v)[0] += (a)[0],(v)[1] += (a)[1],(v)[2] += (a)[2]) |
55 |
|
|
#define ISUBV3(v,a) ((v)[0] -= (a)[0],(v)[1] -= (a)[1],(v)[2] -= (a)[2]) |
56 |
|
|
#define ISCALEV3(v,a) ((v)[0] *= (a),(v)[1] *= (a),(v)[2] *= (a)) |
57 |
|
|
#define IDIVV3(v,a) ((v)[0] /= (a),(v)[1] /= (a),(v)[2] /= (a)) |
58 |
|
|
|
59 |
|
|
|
60 |
|
|
#define ADDV3(v,a,b) ((v)[0] = (a)[0]+(b)[0],(v)[1] = (a)[1]+(b)[1],\ |
61 |
|
|
(v)[2] = (a)[2]+(b)[2]) |
62 |
|
|
#define SUBV3(v,a,b) ((v)[0] = (a)[0]-(b)[0],(v)[1] = (a)[1]-(b)[1],\ |
63 |
|
|
(v)[2] = (a)[2]-(b)[2]) |
64 |
|
|
#define SUMV3(v,a,b,s) ((v)[0] = (a)[0]+(s)*(b)[0],(v)[1]=(a)[1]+(s)*(b)[1],\ |
65 |
|
|
(v)[2] = (a)[2]+(s)*(b)[2]) |
66 |
|
|
#define SCALEV3(v,a,s) ((v)[0]=(a)[0]*(s),(v)[1]=(a)[1]*(s),(v)[2]=(a)[2]*(s)) |
67 |
gwlarson |
3.1 |
#define ZERO_VEC3(v) (ZERO(v[0]) && ZERO(v[1]) && ZERO(v[2]) ) |
68 |
gwlarson |
3.8 |
#define EQUAL_VEC3(a,b) (FEQUAL(a[0],b[0])&&FEQUAL(a[1],b[1])&&FEQUAL(a[2],b[2])) |
69 |
gwlarson |
3.7 |
#define OPP_EQUAL_VEC3(a,b) (EQUAL(a[0],-b[0])&&EQUAL(a[1],-b[1])&&EQUAL(a[2],-b[2])) |
70 |
gwlarson |
3.6 |
#define FZERO_VEC3(v) (FZERO(v[0]) && FZERO(v[1]) && FZERO(v[2]) ) |
71 |
|
|
#define FEQUAL_VEC3(a,b) (FEQUAL(a[0],b[0])&&FEQUAL(a[1],b[1])&&FEQUAL(a[2],b[2])) |
72 |
gwlarson |
3.1 |
#define NEGATE_VEC3(v) ((v)[0] *= -1.0,(v)[1] *= -1.0,(v)[2] *= -1.0) |
73 |
|
|
#define COPY_VEC2(v1,v2) ((v1)[0]=(v2)[0],(v1)[1]=(v2)[1]) |
74 |
|
|
#define DIST(a,b) (sqrt(((a)[0]-(b)[0])*((a)[0]-(b)[0]) + \ |
75 |
|
|
((a)[1]-(b)[1])*((a)[1]-(b)[1]) + \ |
76 |
|
|
((a)[2]-(b)[2])*((a)[2]-(b)[2]))) |
77 |
gwlarson |
3.3 |
#define DIST_SQ(a,b) (((a)[0]-(b)[0])*((a)[0]-(b)[0]) + \ |
78 |
|
|
((a)[1]-(b)[1])*((a)[1]-(b)[1]) + \ |
79 |
|
|
((a)[2]-(b)[2])*((a)[2]-(b)[2])) |
80 |
gwlarson |
3.1 |
|
81 |
gwlarson |
3.7 |
#define SIGN(x) ((x<0)?-1:1) |
82 |
gwlarson |
3.1 |
#define CROSS_VEC2(v1,v2) (((v1)[0]*(v2)[1]) - ((v1)[1]*(v2)[0])) |
83 |
|
|
#define DOT_VEC2(v1,v2) ((v1)[0]*(v2)[0] + (v1)[1]*(v2)[1]) |
84 |
|
|
|
85 |
gwlarson |
3.7 |
#define EDGE_MIDPOINT(a,v1,v2) ((a)[0]=((v1)[0]+(v2)[0])*0.5, \ |
86 |
gwlarson |
3.1 |
(a)[1]=((v1)[1]+(v2)[1])*0.5,(a)[2] = ((v1)[2]+(v2)[2])*0.5) |
87 |
|
|
|
88 |
|
|
#define MIN_VEC3(v) ((v)[0]<(v)[1]?((v)[0]<(v)[2]?(v)[0]:v[2]): \ |
89 |
|
|
(v)[1]<(v)[2]?(v)[1]:(v)[2]) |
90 |
gwlarson |
3.5 |
#define MAX3(a,b,c) (((b)>(a))?((b) > (c))?(b):(c):((a)>(c))?(a):(c)) |
91 |
greg |
3.12 |
#define MIN3(a,b,c) (((b)<(a))?((b) < (c))?(b):(c):((a)<(c))?(a):(c)) |
92 |
|
|
|
93 |
gwlarson |
3.5 |
#define MAX(a,b) (((b)>(a))?(b):(a)) |
94 |
|
|
#define MIN(a,b) (((b)<(a))?(b):(a)) |
95 |
gwlarson |
3.2 |
|
96 |
gwlarson |
3.1 |
#define SUM_3VEC3(r,a,b,c) ((r)[0]=(a)[0]+(b)[0]+(c)[0], \ |
97 |
|
|
(r)[1]=(a)[1]+(b)[1]+(c)[1],(r)[2]=(a)[2]+(b)[2]+(c)[2]) |
98 |
|
|
|
99 |
|
|
#define NTH_BIT(n,i) ((n) & (1<<(i))) |
100 |
|
|
#define SET_NTH_BIT(n,i) ((n) |= (1<<(i))) |
101 |
|
|
|
102 |
greg |
3.12 |
#define PT_ON_PLANE(p,peq) (DOT(FP_N(peq),p)+FP_D(peq)) |
103 |
gwlarson |
3.1 |
|
104 |
greg |
3.12 |
/* FUNCTIONS: |
105 |
|
|
int point_in_cone(FVECT p,a,b,c) |
106 |
|
|
void triangle_centroid(FVECT v0,v1,v2,c) |
107 |
|
|
double tri_normal(FVECT v0,v1,v2,n,int norm) |
108 |
|
|
void tri_plane_equation(FVECT v0,v1,v2,FPEQ *peqptr,int norm) |
109 |
|
|
int intersect_ray_plane(FVECT orig,dir,FPEQ peq,double *pd,FVECT r) |
110 |
|
|
double point_on_sphere(FVECT ps,p,c) |
111 |
|
|
int point_in_stri(FVECT v0,v1,v2,p) |
112 |
|
|
int ray_intersect_tri(FVECT orig,dir,v0,v1,v2,pt) |
113 |
|
|
void calculate_view_frustum(FVECT vp,hv,vv,double horiz,vert,near,far, |
114 |
|
|
FVECT fnear[4],ffar[4]) |
115 |
|
|
void bary2d(double x1,y1,x2,y2,x3,y3,px,py,coord) |
116 |
|
|
*/ |
117 |
gwlarson |
3.1 |
double tri_normal(); |
118 |
gwlarson |
3.7 |
double point_on_sphere(); |
119 |
gwlarson |
3.1 |
|
120 |
|
|
|
121 |
gwlarson |
3.7 |
|