Lines Matching defs:thisEdge
342 directedLine* thisEdge = vert;
349 if(isBelow(vert, thisEdge) && isBelow(vert, prevEdge) && compEdges(prevEdge, thisEdge)<0)
364 else if(isAbove(vert, thisEdge) && isAbove(vert, prevEdge) && compEdges(prevEdge, thisEdge)>0)
734 directedLine* thisEdge = vert;
737 if(isBelow(vert, thisEdge) && isAbove(vert, prevEdge))
743 * find the edge to the right of thisEdge for right range.
744 * delete thisEdge
747 treeNode* thisNode = TreeNodeFind(searchTree, thisEdge, ( Int (*) (void *, void *))compEdges);
759 else if(isAbove(vert, thisEdge) && isBelow(vert, prevEdge))
765 * find the edge to the left of thisEdge for left range.
767 * insert thisEdge
773 searchTree = TreeNodeInsert(searchTree, TreeNodeMake(thisEdge), ( Int (*) (void *, void *))compEdges);
776 else if(isAbove(vert, thisEdge) && isAbove(vert, prevEdge))
780 treeNode* thisNode = TreeNodeMake(thisEdge);
784 if(compEdges(thisEdge, prevEdge)<0) /*interior cusp*/
796 ret_ranges[i] = sweepRangeMake( prevEdge, 1, thisEdge, 1);
799 else if(isBelow(vert, thisEdge) && isBelow(vert, prevEdge))
803 treeNode* thisNode = TreeNodeFind(searchTree, thisEdge, ( Int (*) (void *, void *))compEdges);
805 if(compEdges(thisEdge, prevEdge)>0) /*interior cusp*/
815 ret_ranges[i] = sweepRangeMake( thisEdge, 1, prevEdge, 1);
825 printf("thisEdge is\n");
826 thisEdge->printSingle();