File indexing completed on 2024-04-14 14:11:08
0001 /* 0002 ** Author: Eric Veach, July 1994. 0003 ** 0004 */ 0005 0006 #ifndef __geom_h_ 0007 #define __geom_h_ 0008 0009 #include "mesh.h" 0010 0011 #ifdef NO_BRANCH_CONDITIONS 0012 /* MIPS architecture has special instructions to evaluate boolean 0013 * conditions -- more efficient than branching, IF you can get the 0014 * compiler to generate the right instructions (SGI compiler doesn't) 0015 */ 0016 #define VertEq(u, v) (((u)->s == (v)->s) & ((u)->t == (v)->t)) 0017 #define VertLeq(u, v) (((u)->s < (v)->s) | ((u)->s == (v)->s & (u)->t <= (v)->t)) 0018 #else 0019 #define VertEq(u, v) ((u)->s == (v)->s && (u)->t == (v)->t) 0020 #define VertLeq(u, v) (((u)->s < (v)->s) || ((u)->s == (v)->s && (u)->t <= (v)->t)) 0021 #endif 0022 0023 #define EdgeEval(u, v, w) __gl_edgeEval(u, v, w) 0024 #define EdgeSign(u, v, w) __gl_edgeSign(u, v, w) 0025 0026 /* Versions of VertLeq, EdgeSign, EdgeEval with s and t transposed. */ 0027 0028 #define TransLeq(u, v) (((u)->t < (v)->t) || ((u)->t == (v)->t && (u)->s <= (v)->s)) 0029 #define TransEval(u, v, w) __gl_transEval(u, v, w) 0030 #define TransSign(u, v, w) __gl_transSign(u, v, w) 0031 0032 #define EdgeGoesLeft(e) VertLeq((e)->Dst, (e)->Org) 0033 #define EdgeGoesRight(e) VertLeq((e)->Org, (e)->Dst) 0034 0035 #undef ABS 0036 #define ABS(x) ((x) < 0 ? -(x) : (x)) 0037 #define VertL1dist(u, v) (ABS(u->s - v->s) + ABS(u->t - v->t)) 0038 0039 #define VertCCW(u, v, w) __gl_vertCCW(u, v, w) 0040 0041 int __gl_vertLeq(GLUvertex *u, GLUvertex *v); 0042 GLdouble __gl_edgeEval(GLUvertex *u, GLUvertex *v, GLUvertex *w); 0043 GLdouble __gl_edgeSign(GLUvertex *u, GLUvertex *v, GLUvertex *w); 0044 GLdouble __gl_transEval(GLUvertex *u, GLUvertex *v, GLUvertex *w); 0045 GLdouble __gl_transSign(GLUvertex *u, GLUvertex *v, GLUvertex *w); 0046 int __gl_vertCCW(GLUvertex *u, GLUvertex *v, GLUvertex *w); 0047 void __gl_edgeIntersect(GLUvertex *o1, GLUvertex *d1, GLUvertex *o2, GLUvertex *d2, GLUvertex *v); 0048 0049 #endif