Lines Matching defs:rightEdge
488 treeNode* rightEdge = TreeNodeSuccessor(thisNode);
489 if(leftEdge == NULL || rightEdge == NULL)
499 directedLine* rightEdgeDline = ((monoChain* ) rightEdge->key)->find(keyY);
533 treeNode* rightEdge = TreeNodeSuccessor(prevNode);
534 if(leftEdge == NULL || rightEdge == NULL)
539 //printf("leftEdge is %i, rightEdge is %i\n", leftEdge, rightEdge);
541 directedLine* rightEdgeDline = ((monoChain*) rightEdge->key)->find(keyY);
588 directedLine* rightEdge = ranges[i]->right;
591 directedLine* rightVert = rightEdge->getNext();
618 directedLine* rightEdge = ranges[i]->right;
620 directedLine* rightVert = rightEdge;