Lines Matching refs:Lface
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 is unaffected.
340 if( eDst->Lface != eOrg->Lface ) {
341 /* We are connecting two disjoint loops -- destroy eDst->Lface */
343 KillFace( eDst->Lface, eOrg->Lface );
363 /* We split one loop into two -- the new loop is eDst->Lface.
366 MakeFace( newFace, eDst, eOrg->Lface );
367 eOrg->Lface->anEdge = eOrg;
375 * if (eDel->Lface != eDel->Rface), we join two loops into one; the loop
376 * eDel->Lface is deleted. Otherwise, we are splitting one loop into two;
392 if( eDel->Lface != eDel->Rface ) {
395 KillFace( eDel->Lface, eDel->Rface );
411 MakeFace( newFace, eDel, eDel->Lface );
420 KillFace( eDelSym->Lface, NULL );
422 /* Make sure that eDel->Dst and eDel->Lface point to valid half-edges */
423 eDel->Lface->anEdge = eDelSym->Oprev;
465 eNew->Lface = eNewSym->Lface = eOrg->Lface;
500 * If eOrg->Lface == eDst->Lface, this splits one loop into two,
501 * and the newly created loop is eNew->Lface. Otherwise, two disjoint
502 * loops are merged into one, and the loop eDst->Lface is destroyed.
517 if( eDst->Lface != eOrg->Lface ) {
518 /* We are connecting two disjoint loops -- destroy eDst->Lface */
520 KillFace( eDst->Lface, eOrg->Lface );
530 eNew->Lface = eNewSym->Lface = eOrg->Lface;
533 eOrg->Lface->anEdge = eNewSym;
539 /* We split one loop into two -- the new loop is eNew->Lface */
540 MakeFace( newFace, eNew, eOrg->Lface );
567 e->Lface = NULL;
635 e->Lface = NULL;
644 eSym->Lface = NULL;
760 assert( e->Lface == f );
795 && e->Lface == NULL && e->Rface == NULL );