Lines Matching refs:eDel
201 /* KillEdge( eDel ) destroys an edge (the half-edges eDel and eDel->Sym),
204 static void KillEdge( GLUhalfEdge *eDel )
209 if( eDel->Sym < eDel ) { eDel = eDel->Sym; }
212 eNext = eDel->next;
213 ePrev = eDel->Sym->next;
217 memFree( eDel );
374 /* __gl_meshDelete( eDel ) removes the edge eDel. There are several cases:
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;
377 * the newly created loop will contain eDel->Dst. If the deletion of eDel
384 int __gl_meshDelete( GLUhalfEdge *eDel )
386 GLUhalfEdge *eDelSym = eDel->Sym;
389 /* First step: disconnect the origin vertex eDel->Org. We make all
392 if( eDel->Lface != eDel->Rface ) {
395 KillFace( eDel->Lface, eDel->Rface );
398 if( eDel->Onext == eDel ) {
399 KillVertex( eDel->Org, NULL );
401 /* Make sure that eDel->Org and eDel->Rface point to valid half-edges */
402 eDel->Rface->anEdge = eDel->Oprev;
403 eDel->Org->anEdge = eDel->Onext;
405 Splice( eDel, eDel->Oprev );
410 /* We are splitting one loop into two -- create a new loop for eDel. */
411 MakeFace( newFace, eDel, eDel->Lface );
415 /* Claim: the mesh is now in a consistent state, except that eDel->Org
416 * may have been deleted. Now we disconnect eDel->Dst.
422 /* Make sure that eDel->Dst and eDel->Lface point to valid half-edges */
423 eDel->Lface->anEdge = eDelSym->Oprev;
429 KillEdge( eDel );