Searched refs:pwlArc (Results 1 - 15 of 15) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Djarcloc.h47 inline void init( Arc_ptr a, long first, long last ) { arc = a; p=&a->pwlArc->pts[first]; plast = &a->pwlArc->pts[last]; }
56 if( plast == &arc->pwlArc->pts[0] )
57 plast = &arc->pwlArc->pts[arc->pwlArc->npts - 1];
59 plast = &arc->pwlArc->pts[0];
68 p = &arc->pwlArc->pts[0];
69 plast = &arc->pwlArc->pts[arc->pwlArc->npts - 1];
81 p = &arc->pwlArc
[all...]
H A Darc.h65 PwlArc * pwlArc; /* associated pwl arc */ member in class:Arc
82 inline int isTessellated() { return pwlArc ? 1 : 0; }
86 inline long npts() { return pwlArc->npts; }
87 inline TrimVertex * pts() { return pwlArc->pts; }
88 inline REAL * tail() { return pwlArc->pts[0].param; }
89 inline REAL * head() { return next->pwlArc->pts[0].param; }
90 inline REAL * rhead() { return pwlArc->pts[pwlArc->npts-1].param; }
115 pwlArc = p;
133 pwlArc
[all...]
H A Darc.cc65 assert( pwlArc == 0 );
68 pwlArc = pwl;
85 npts += jarc->pwlArc->npts;
102 TrimVertex *p = jarc->pwlArc->pts;
103 for( int i=0; i<jarc->pwlArc->npts; i++ )
127 leftpt = jarc->pwlArc->pts->param[0];
132 rightpt = jarc->pwlArc->pts->param[0];
137 botpt = jarc->pwlArc->pts->param[1];
142 toppt = jarc->pwlArc->pts->param[1];
158 _glu_dprintf( "\tPWLARC NP: %d FL: 1\n", pwlArc
[all...]
H A Darcsorter.cc98 int v1 = (jarc1->getitail() ? 0 : (jarc1->pwlArc->npts - 1));
99 int v2 = (jarc2->getitail() ? 0 : (jarc2->pwlArc->npts - 1));
101 REAL diff = jarc1->pwlArc->pts[v1].param[1] -
102 jarc2->pwlArc->pts[v2].param[1];
143 int v1 = (jarc1->getitail() ? 0 : (jarc1->pwlArc->npts - 1));
144 int v2 = (jarc2->getitail() ? 0 : (jarc2->pwlArc->npts - 1));
146 REAL diff = jarc1->pwlArc->pts[v1].param[0] -
147 jarc2->pwlArc->pts[v2].param[0];
H A Dslicer.cc186 for(i=1; i<=top->pwlArc->npts-2; i++)
189 inc_chain.appendVertex(top->pwlArc->pts[i].param);
193 for(i=0; i<=jarc->pwlArc->npts-2; i++)
195 inc_chain.appendVertex(jarc->pwlArc->pts[i].param);
202 for(i=jarc->pwlArc->npts-2; i>=0; i--)
204 dec_chain.appendVertex(jarc->pwlArc->pts[i].param);
207 for(i=bot->pwlArc->npts-2; i>=1; i--)
209 dec_chain.appendVertex(jarc->pwlArc->pts[i].param);
358 int nu = top->pwlArc->npts;
359 if(nu < bot->pwlArc
[all...]
H A DdataTransform.cc55 for(j=0; j<loop->pwlArc->npts-1; j++, i++)
57 vertArray[i][0] = loop->pwlArc->pts[j].param[0];
58 vertArray[i][1] = loop->pwlArc->pts[j].param[1];
64 for(j=0; j<jarc->pwlArc->npts-1; j++, i++)
66 vertArray[i][0] = jarc->pwlArc->pts[j].param[0];
67 vertArray[i][1] = jarc->pwlArc->pts[j].param[1];
72 vertArray[i][0] = loop->pwlArc->pts[0].param[0];
73 vertArray[i][1] = loop->pwlArc->pts[0].param[1];
104 sum += jarc->pwlArc->npts-1;
H A Dccw.cc59 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];
172 TrimVertex *v1 = &j1->pwlArc->pts[j1->pwlArc->npts-1];
173 TrimVertex *v1last = &j1->pwlArc->pts[0];
174 TrimVertex *v2 = &j2->pwlArc
[all...]
H A Dmonotonizer.cc116 TrimVertex *firstvert = jarc->pwlArc->pts;
117 TrimVertex *lastvert = firstvert + (jarc->pwlArc->npts - 1);
178 jarc->pwlArc->npts = vert - firstvert + 1;
180 jarc->pwlArc = new(pwlarcpool) PwlArc();
183 firstvert = jarc->pwlArc->pts = vert;
187 jarc->pwlArc->npts = vert - firstvert + 1;
200 jarc->pwlArc->deleteMe( pwlarcpool ); jarc->pwlArc = 0;
212 TrimVertex *firstvert = jarc->pwlArc->pts;
213 TrimVertex *lastvert = firstvert + (jarc->pwlArc
[all...]
H A Dbin.cc155 assert( jarc->pwlArc->npts == 2 );
157 TrimVertex *pts = jarc->pwlArc->pts;
H A DmonoTriangulationBackend.cc275 for(i=1; i<=topV->pwlArc->npts-2; i++) { /*the first vertex is the top vertex which doesn't belong to inc_chain*/
276 inc_chain.appendVertex(topV->pwlArc->pts[i].param);
280 for(i=0; i<=tempV->pwlArc->npts-2; i++){
281 inc_chain.appendVertex(tempV->pwlArc->pts[i].param);
288 for(i=tempV->pwlArc->npts-2; i>=0; i--){
289 dec_chain.appendVertex(tempV->pwlArc->pts[i].param);
292 for(i=botV->pwlArc->npts-2; i>=1; i--){
293 dec_chain.appendVertex(tempV->pwlArc->pts[i].param);
H A Dintersect.cc177 int maxvertex = jarc->pwlArc->npts;
179 TrimVertex* v = jarc->pwlArc->pts;
182 switch( pwlarc_intersect( jarc->pwlArc, param, value, dir, loc ) ) {
187 jarc->pwlArc->npts = loc[1] + 1;
234 jarc->pwlArc->pts=vcopy;
250 jarc->pwlArc->npts = j+2;
276 jarc->pwlArc->npts = 2;
277 jarc->pwlArc->pts = newjunk;
290 jarc->pwlArc->npts = maxvertex-1;
304 new(pwlarcpool) PwlArc( maxvertex-1, &jarc->pwlArc
346 pwlarc_intersect(PwlArc * pwlArc,int param,REAL value,int dir,int loc[3]) argument
[all...]
H A Dtrimline.cc164 PwlArc *lastpwl = botarc->prev->pwlArc;
167 TrimVertex *lastpt2 = botarc->pwlArc->pts;
180 PwlArc *lastpwl = botarc->prev->pwlArc;
183 TrimVertex *lastpt2 = botarc->pwlArc->pts;
H A Dsubdivider.cc161 jarc->pwlArc = 0;
180 jarc->pwlArc = new(pwlarcpool) PwlArc( npts, pts );
682 if(jarc->pwlArc->npts >2)
684 c = jarc->pwlArc->pts[jarc->pwlArc->npts-2].param;
688 assert(jarc->prev->pwlArc->npts>2);
689 a = jarc->prev->pwlArc->pts[jarc->prev->pwlArc->npts-2].param;
852 if( jarc->pwlArc ) jarc->pwlArc
[all...]
H A Darctess.cc109 arc->pwlArc = new(pwlarcpool) PwlArc( 2, p );
266 arc->pwlArc = new(pwlarcpool) PwlArc( nsteps+1, newvert );
281 assert( arc->pwlArc == NULL );
326 assert( arc->pwlArc == NULL );
365 arc->pwlArc = new(pwlarcpool) PwlArc();
366 arc->pwlArc->pts = vert;
493 arc->pwlArc->npts = vert - arc->pwlArc->pts + 1;
495 for( TrimVertex *vt=pwlArc->pts; vt != vert-1; vt++ ) {
H A Dtrimregion.cc58 left.init( npts, extrema, extrema->pwlArc->npts - 1 );

Completed in 166 milliseconds