Searched refs:TrimVertex (Results 1 - 25 of 28) sorted by relevance

12

/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Dtrimvertpool.h41 class TrimVertex;
50 TrimVertex * get( int );
53 TrimVertex ** vlist;
H A Dtrimline.h48 TrimVertex** pts;
53 TrimVertex t, b;
54 TrimVertex *tinterp, *binterp;
58 inline void append( TrimVertex * );
59 static long interpvert( TrimVertex *, TrimVertex *, TrimVertex *, REAL );
66 void init( TrimVertex * );
74 inline TrimVertex * next( void );
75 inline TrimVertex * pre
[all...]
H A Dpwlarc.h42 class TrimVertex;
46 TrimVertex * pts; /* sample points */
50 inline PwlArc( int, TrimVertex * );
51 inline PwlArc( int, TrimVertex *, long );
63 PwlArc::PwlArc( int _npts, TrimVertex *_pts )
71 PwlArc::PwlArc( int _npts, TrimVertex *_pts, long _type )
H A Dcoveandtiler.h59 void coveUpperLeftNoGrid( TrimVertex * );
60 void coveUpperRightNoGrid( TrimVertex * );
61 void coveLowerLeftNoGrid( TrimVertex * );
62 void coveLowerRightNoGrid( TrimVertex * );
69 inline void output( TrimVertex* );
H A Dtrimvertex.h43 class TrimVertex { /* a vertex on a trim curve */ class
53 typedef class TrimVertex *TrimVertex_p;
56 det3( TrimVertex *a, TrimVertex *b, TrimVertex *c )
H A Dtrimvertpool.cc53 : pool( sizeof(TrimVertex)*3, 32, "Threevertspool" )
102 TrimVertex *
105 TrimVertex *v;
107 v = (TrimVertex *) pool.new_buffer();
116 v = vlist[nextvlistslot++] = new TrimVertex[n];
H A Dgridtrimvertex.h47 TrimVertex dummyt;
51 TrimVertex *t;
56 inline void set( TrimVertex * );
82 GridTrimVertex::set( TrimVertex *v )
H A Dbackend.h66 void tmeshvert( TrimVertex * );
69 void linevert( TrimVertex * );
74 void triangle( TrimVertex*, TrimVertex*, TrimVertex* );
86 void tmeshvertNOGE(TrimVertex *t);
87 void tmeshvertNOGE_BU(TrimVertex *t);
88 void tmeshvertNOGE_BV(TrimVertex *t);
H A Dtrimregion.cc86 TrimRegion::getGridExtent( TrimVertex *l, TrimVertex *r )
104 TrimVertex *lf = left.first();
105 TrimVertex *ll = left.last();
106 TrimVertex *l = ( ll->param[0] > lf->param[0] ) ? ll : lf;
108 TrimVertex *rf = right.first();
109 TrimVertex *rl = right.last();
110 TrimVertex *r = ( rl->param[0] < rf->param[0] ) ? rl : rf;
H A Djarcloc.h44 TrimVertex *p;
45 TrimVertex *plast;
48 inline TrimVertex * getnextpt( void );
49 inline TrimVertex * getprevpt( void );
62 inline TrimVertex *
75 inline TrimVertex *
H A Dreader.cc60 O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpts )
73 TrimVertex *v = pts;
74 TrimVertex *prev = NULL;
101 TrimVertex *v = pts;
102 for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
112 O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpts )
124 TrimVertex *v = pts;
125 for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
133 TrimVertex *v = pts;
134 for( TrimVertex *last
[all...]
H A Dccw.cc50 Subdivider::bbox( TrimVertex *a, TrimVertex *b, TrimVertex *c, int p )
59 TrimVertex *v1 = &j1->pwlArc->pts[j1->pwlArc->npts-1];
60 TrimVertex *v1last = &j1->pwlArc->pts[0];
61 TrimVertex *v2 = &j2->pwlArc->pts[0];
62 TrimVertex *v2last = &j2->pwlArc->pts[j2->pwlArc->npts-1];
63 TrimVertex *v1next = v1-1;
64 TrimVertex *v2next = v2+1;
172 TrimVertex *v
[all...]
H A Dtrimline.cc58 Trimline::init( TrimVertex *v )
76 Trimline::append( TrimVertex *v )
92 TrimVertex *tmp=tinterp;
120 TrimVertex *p;
142 TrimVertex *q;
165 TrimVertex *lastpt1 = &lastpwl->pts[lastpwl->npts-1];
167 TrimVertex *lastpt2 = botarc->pwlArc->pts;
168 TrimVertex *p = jarcl.getnextpt();
181 TrimVertex *lastpt1 = &lastpwl->pts[lastpwl->npts-1];
183 TrimVertex *lastpt
[all...]
H A Dtrimregion.h61 void getGridExtent( TrimVertex *, TrimVertex * );
H A Dsubdivider.h64 void addArc( int, TrimVertex *, long );
167 inline int bbox( TrimVertex *, TrimVertex *, TrimVertex *, int );
169 static int ccw( TrimVertex *, TrimVertex *, TrimVertex * );
H A Dhull.cc65 TrimVertex *lfirst = left.first();
66 TrimVertex *llast = left.last();
91 TrimVertex *rfirst = right.first();
92 TrimVertex *rlast = right.last();
H A Dcoveandtiler.cc66 CoveAndTiler::output( TrimVertex *tv )
94 TrimVertex blv, tlv, *bl, *tl;
96 TrimVertex *lf = left.first();
97 TrimVertex *ll = left.last();
130 TrimVertex brv, trv, *br, *tr;
132 TrimVertex *rf = right.first();
133 TrimVertex *rl = right.last();
213 CoveAndTiler::coveUpperRightNoGrid( TrimVertex* br )
228 TrimVertex *vert = right.next();
275 CoveAndTiler::coveUpperLeftNoGrid( TrimVertex* b
[all...]
H A Dreader.h52 class TrimVertex;
85 TrimVertex *pts; /* array of trim vertices */
91 O_pwlcurve( long, long, INREAL *, long, TrimVertex * );
H A Dslicer.h47 class TrimVertex;
H A Dmonotonizer.cc116 TrimVertex *firstvert = jarc->pwlArc->pts;
117 TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1);
127 TrimVertex *vert;
212 TrimVertex *firstvert = jarc->pwlArc->pts;
213 TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1);
217 TrimVertex *vert = firstvert;
H A Dbackend.cc279 Backend::tmeshvertNOGE(TrimVertex *t)
289 Backend::tmeshvertNOGE_BU(TrimVertex *t)
298 Backend::tmeshvertNOGE_BV(TrimVertex *t)
323 Backend::tmeshvert( TrimVertex *t )
487 Backend::linevert( TrimVertex *t )
517 Backend::triangle( TrimVertex *a, TrimVertex *b, TrimVertex *c )
H A Darc.h87 inline TrimVertex * pts() { return pwlArc->pts; }
H A Dbin.cc157 TrimVertex *pts = jarc->pwlArc->pts;
H A Darctess.cc108 TrimVertex *p = trimvertexpool.get(2);
136 TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
165 TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
195 TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
224 TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
254 TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
361 TrimVertex *vert = trimvertexpool.get( nsteps+1 );
495 for( TrimVertex *vt=pwlArc->pts; vt != vert-1; vt++ ) {
H A Dintersect.cc157 vert_interp( TrimVertex *n, TrimVertex *l, TrimVertex *r, int p, REAL val )
179 TrimVertex* v = jarc->pwlArc->pts;
220 TrimVertex *newjunk = trimvertexpool.get(maxvertex -i+1 /*-j*/);
228 TrimVertex *vcopy = trimvertexpool.get(maxvertex);
263 TrimVertex *newjunk = trimvertexpool.get(3);
356 TrimVertex *v = pwlArc->pts;
376 TrimVertex *v = pwlArc->pts;

Completed in 35 milliseconds

12