HomeSort by relevance Sort by last modified time
    Searched refs:Lnext (Results 1 - 7 of 7) sorted by null

  /external/skia/third_party/glu/libtess/
tessmono.c 89 assert( up->Lnext != up && up->Lnext->Lnext != up );
93 for( ; VertLeq( up->Org, up->Dst ); up = up->Lnext )
97 while( up->Lnext != lo ) {
103 while( lo->Lnext != up && (EdgeGoesLeft( lo->Lnext )
104 || EdgeSign( lo->Org, lo->Dst, lo->Lnext->Dst ) <= 0 )) {
105 GLUhalfEdge *tempHalfEdge= __gl_meshConnect( lo->Lnext, lo );
112 while( lo->Lnext != up && (EdgeGoesRight( up->Lprev
    [all...]
mesh.h 71 * (Onext) and around the left face (Lnext). There is also a "next"
78 * Lnext = edge CCW around left face (dest becomes new origin)
149 GLUhalfEdge *Lnext; /* next edge CCW around left face */
162 #define Oprev Sym->Lnext
164 #define Dprev Lnext->Sym
221 * eNew == eOrg->Lnext, and eNew->Dst is a newly created vertex.
225 * such that eNew == eOrg->Lnext. The new vertex is eOrg->Dst == eNew->Org.
mesh.c 97 e->Lnext = eSym;
105 eSym->Lnext = e;
125 aOnext->Sym->Lnext = b;
126 bOnext->Sym->Lnext = a;
200 e = e->Lnext;
260 e = e->Lnext;
321 * If eDst == eOrg->Lnext, the new face will have a single edge.
441 * eNew == eOrg->Lnext, and eNew->Dst is a newly created vertex.
453 Splice( eNew, eOrg->Lnext );
470 * such that eNew == eOrg->Lnext. The new vertex is eOrg->Dst == eNew->Org
    [all...]
sweep.c 195 e = __gl_meshConnect( RegionBelow(reg)->eUp->Sym, reg->eUp->Lnext );
600 if ( !__gl_meshSplice( eUp->Lnext, eLo->Sym ) ) longjmp(tess->env,1);
708 if ( !__gl_meshSplice( eUp->Lnext, eLo->Oprev ) ) longjmp(tess->env,1);
    [all...]
render.c 131 newFace = MaximumFan( e->Lnext ); if( newFace.size > max.size ) { max = newFace; }
135 newFace = MaximumStrip( e->Lnext ); if( newFace.size > max.size ) { max = newFace; }
191 * eOrig->Org, eOrig->Dst, eOrig->Lnext->Dst (in that order or the
279 e = e->Lnext;
353 e = e->Lnext;
normal.c 159 e = e->Lnext;
tess.c 365 e = e->Lnext;

Completed in 741 milliseconds