Lines Matching refs:Lface
99 e->Lface = NULL;
107 eSym->Lface = NULL;
199 e->Lface = fNew;
259 e->Lface = newLface;
315 * - if eOrg->Lface == eDst->Lface, one loop is split into two
316 * - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one
317 * In both cases, eDst->Lface is changed and eOrg->Lface is unaffected.
338 if( eDst->Lface != eOrg->Lface ) {
339 /* We are connecting two disjoint loops -- destroy eDst->Lface */
341 KillFace( eDst->Lface, eOrg->Lface );
361 /* We split one loop into two -- the new loop is eDst->Lface.
364 MakeFace( newFace, eDst, eOrg->Lface );
365 eOrg->Lface->anEdge = eOrg;
373 * if (eDel->Lface != eDel->Rface), we join two loops into one; the loop
374 * eDel->Lface is deleted. Otherwise, we are splitting one loop into two;
390 if( eDel->Lface != eDel->Rface ) {
393 KillFace( eDel->Lface, eDel->Rface );
409 MakeFace( newFace, eDel, eDel->Lface );
418 KillFace( eDelSym->Lface, NULL );
420 /* Make sure that eDel->Dst and eDel->Lface point to valid half-edges */
421 eDel->Lface->anEdge = eDelSym->Oprev;
463 eNew->Lface = eNewSym->Lface = eOrg->Lface;
498 * If eOrg->Lface == eDst->Lface, this splits one loop into two,
499 * and the newly created loop is eNew->Lface. Otherwise, two disjoint
500 * loops are merged into one, and the loop eDst->Lface is destroyed.
515 if( eDst->Lface != eOrg->Lface ) {
516 /* We are connecting two disjoint loops -- destroy eDst->Lface */
518 KillFace( eDst->Lface, eOrg->Lface );
528 eNew->Lface = eNewSym->Lface = eOrg->Lface;
531 eOrg->Lface->anEdge = eNewSym;
537 /* We split one loop into two -- the new loop is eNew->Lface */
538 Lface );
565 e->Lface = NULL;
633 e->Lface = NULL;
642 eSym->Lface = NULL;
758 assert( e->Lface == f );
793 && e->Lface == NULL && e->Rface == NULL );
