69 lines
2.5 KiB
C
69 lines
2.5 KiB
C
|
#ifndef __geom_h_
|
||
|
|
#define __geom_h_
|
||
|
|
|
||
|
|
/*
|
||
|
|
** Copyright 1994, Silicon Graphics, Inc.
|
||
|
|
** All Rights Reserved.
|
||
|
|
**
|
||
|
|
** This is UNPUBLISHED PROPRIETARY SOURCE CODE of Silicon Graphics, Inc.;
|
||
|
|
** the contents of this file may not be disclosed to third parties, copied or
|
||
|
|
** duplicated in any form, in whole or in part, without the prior written
|
||
|
|
** permission of Silicon Graphics, Inc.
|
||
|
|
**
|
||
|
|
** RESTRICTED RIGHTS LEGEND:
|
||
|
|
** Use, duplication or disclosure by the Government is subject to restrictions
|
||
|
|
** as set forth in subdivision (c)(1)(ii) of the Rights in Technical Data
|
||
|
|
** and Computer Software clause at DFARS 252.227-7013, and/or in similar or
|
||
|
|
** successor clauses in the FAR, DOD or NASA FAR Supplement. Unpublished -
|
||
|
|
** rights reserved under the Copyright Laws of the United States.
|
||
|
|
**
|
||
|
|
** Author: Eric Veach, July 1994.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "mesh.h"
|
||
|
|
|
||
|
|
#ifdef NO_BRANCH_CONDITIONS
|
||
|
|
/* MIPS architecture has special instructions to evaluate boolean
|
||
|
|
* conditions -- more efficient than branching, IF you can get the
|
||
|
|
* compiler to generate the right instructions (SGI compiler doesn't)
|
||
|
|
*/
|
||
|
|
#define VertEq(u,v) (((u)->s == (v)->s) & ((u)->t == (v)->t))
|
||
|
|
#define VertLeq(u,v) (((u)->s < (v)->s) | \
|
||
|
|
((u)->s == (v)->s & (u)->t <= (v)->t))
|
||
|
|
#else
|
||
|
|
#define VertEq(u,v) ((u)->s == (v)->s && (u)->t == (v)->t)
|
||
|
|
#define VertLeq(u,v) (((u)->s < (v)->s) || \
|
||
|
|
((u)->s == (v)->s && (u)->t <= (v)->t))
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#define EdgeEval(u,v,w) __gl_edgeEval(u,v,w)
|
||
|
|
#define EdgeSign(u,v,w) __gl_edgeSign(u,v,w)
|
||
|
|
|
||
|
|
/* Versions of VertLeq, EdgeSign, EdgeEval with s and t transposed. */
|
||
|
|
|
||
|
|
#define TransLeq(u,v) (((u)->t < (v)->t) || \
|
||
|
|
((u)->t == (v)->t && (u)->s <= (v)->s))
|
||
|
|
#define TransEval(u,v,w) __gl_transEval(u,v,w)
|
||
|
|
#define TransSign(u,v,w) __gl_transSign(u,v,w)
|
||
|
|
|
||
|
|
|
||
|
|
#define EdgeGoesLeft(e) VertLeq( (e)->Dst, (e)->Org )
|
||
|
|
#define EdgeGoesRight(e) VertLeq( (e)->Org, (e)->Dst )
|
||
|
|
|
||
|
|
#define ABS(x) ((x) < 0 ? -(x) : (x))
|
||
|
|
#define VertL1dist(u,v) (ABS(u->s - v->s) + ABS(u->t - v->t))
|
||
|
|
|
||
|
|
#define VertCCW(u,v,w) __gl_vertCCW(u,v,w)
|
||
|
|
|
||
|
|
int __gl_vertLeq( GLUvertex *u, GLUvertex *v );
|
||
|
|
GLdouble __gl_edgeEval( GLUvertex *u, GLUvertex *v, GLUvertex *w );
|
||
|
|
GLdouble __gl_edgeSign( GLUvertex *u, GLUvertex *v, GLUvertex *w );
|
||
|
|
GLdouble __gl_transEval( GLUvertex *u, GLUvertex *v, GLUvertex *w );
|
||
|
|
GLdouble __gl_transSign( GLUvertex *u, GLUvertex *v, GLUvertex *w );
|
||
|
|
int __gl_vertCCW( GLUvertex *u, GLUvertex *v, GLUvertex *w );
|
||
|
|
void __gl_edgeIntersect( GLUvertex *o1, GLUvertex *d1,
|
||
|
|
GLUvertex *o2, GLUvertex *d2,
|
||
|
|
GLUvertex *v );
|
||
|
|
|
||
|
|
#endif
|