Searched refs:Lface (Results 1 - 5 of 5) sorted by relevance
| /xsrc/external/mit/glu/dist/src/libtess/ |
| H A D | mesh.c | 96 e->Lface = NULL; 104 eSym->Lface = NULL; 196 e->Lface = fNew; 256 e->Lface = newLface; 317 * - if eOrg->Lface == eDst->Lface, one loop is split into two 318 * - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one 319 * In both cases, eDst->Lface is changed and eOrg->Lface i [all...] |
| H A D | render.c | 160 /* eOrig->Lface is the face we want to render. We want to find the size 168 for( e = eOrig; ! Marked( e->Lface ); e = e->Onext ) { 169 AddToTrail( e->Lface, trail ); 202 for( e = eOrig; ! Marked( e->Lface ); ++tailSize, e = e->Onext ) { 203 AddToTrail( e->Lface, trail ); 206 if( Marked( e->Lface )) break; 207 AddToTrail( e->Lface, trail ); 227 * we must start from eHead to guarantee inclusion of eOrig->Lface. 244 AddToTrail( e->Lface, tess->lonelyTriList ); 293 while( ! Marked( e->Lface )) { [all...] |
| H A D | mesh.h | 62 * its origin vertex (Org), the face on its left side (Lface), and the 144 GLUface *Lface; /* left face */ member in struct:GLUhalfEdge 152 #define Rface Sym->Lface 177 * global list *before* the existing vertex or face (ie. e->Org or e->Lface). 201 * - if eOrg->Lface == eDst->Lface, one loop is split into two 202 * - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one 203 * In both cases, eDst->Lface is changed and eOrg->Lface i [all...] |
| H A D | tessmono.c | 186 if( e->Rface->inside != e->Lface->inside ) { 189 e->winding = (e->Lface->inside) ? value : -value;
|
| H A D | sweep.c | 276 GLUface *f = e->Lface; 595 e->Lface->inside = regUp->inside; 747 * the mesh (ie. eUp->Lface) to be smaller than the faces in the 748 * unprocessed original contours (which will be eLo->Oprev->Lface).
|
Completed in 11 milliseconds