235         , fBottom(bottom)  in Edge()
248     Vertex*  fBottom;           // The bottom vertex in vertex-sort-order.  member
270         fDX = static_cast<double>(fBottom->fPoint.fX) - fTop->fPoint.fX;  in recompute()
271         fDY = static_cast<double>(fBottom->fPoint.fY) - fTop->fPoint.fY;  in recompute()
272         fC = static_cast<double>(fTop->fPoint.fY) * fBottom->fPoint.fX -  in recompute()
273              static_cast<double>(fTop->fPoint.fX) * fBottom->fPoint.fY;  in recompute()
277                fTop->fID, fBottom->fID,  in intersect()
278                other.fTop->fID, other.fBottom->fID);  in intersect()
279         if (fTop == other.fTop || fBottom == other.fBottom) {  in intersect()
646     LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);  in remove_edge()
652     LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);  in insert_edge()
683             (c.sweep_lt(edge->fBottom->fPoint, next->fBottom->fPoint) &&  in find_enclosing_edges()
684              next->isRightOf(edge->fBottom)) ||  in find_enclosing_edges()
685             (c.sweep_lt(next->fBottom->fPoint, edge->fBottom->fPoint) &&  in find_enclosing_edges()
686              edge->isLeftOf(next->fBottom))) {  in find_enclosing_edges()
698         if (edge->fBottom->fProcessed || !edge->fTop->fProcessed) {  in fix_active_state()
701     } else if (edge->fTop->fProcessed && !edge->fBottom->fProcessed) {  in fix_active_state()
710     if (edge->fTop->fPoint == edge->fBottom->fPoint ||  in insert_edge_above()
711         c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {  in insert_edge_above()
714     LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);  in insert_edge_above()
728     if (edge->fTop->fPoint == edge->fBottom->fPoint ||  in insert_edge_below()
729         c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {  in insert_edge_below()
732     LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);  in insert_edge_below()
736         if (next->isRightOf(edge->fBottom)) {  in insert_edge_below()
746     LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID,  in remove_edge_above()
747         edge->fBottom->fID);  in remove_edge_above()
749         edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove);  in remove_edge_above()
753     LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID,  in remove_edge_below()
763     LOG("erasing edge (%g -> %g)\n", edge->fTop->fID, edge->fBottom->fID);  in erase_edge_if_zero_winding()
784     edge->fBottom = v;  in set_bottom()
795             edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY);  in merge_edges_above()
812     if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) {  in merge_edges_below()
815             edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY);  in merge_edges_below()
820     } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) {  in merge_edges_below()
823         set_top(other, edge->fBottom, activeEdges, c);  in merge_edges_below()
827         set_top(edge, other->fBottom, activeEdges, c);  in merge_edges_below()
839     if (edge->fPrevEdgeBelow && (edge->fBottom == edge->fPrevEdgeBelow->fBottom ||  in merge_collinear_edges()
840                                  !edge->fPrevEdgeBelow->isLeftOf(edge->fBottom))) {  in merge_collinear_edges()
842     } else if (edge->fNextEdgeBelow && (edge->fBottom == edge->fNextEdgeBelow->fBottom ||  in merge_collinear_edges()
843                                         !edge->isLeftOf(edge->fNextEdgeBelow->fBottom))) {  in merge_collinear_edges()
852     Vertex* bottom = edge->fBottom;  in cleanup_active_edges()
855         Vertex* leftBottom = edge->fLeft->fBottom;  in cleanup_active_edges()
869         Vertex* rightBottom = edge->fRight->fBottom;  in cleanup_active_edges()
886         edge->fTop->fID, edge->fBottom->fID,  in split_edge()
890     } else if (c.sweep_gt(v->fPoint, edge->fBottom->fPoint)) {  in split_edge()
893         Edge* newEdge = ALLOC_NEW(Edge, (v, edge->fBottom, edge->fWinding), alloc);  in split_edge()
895         insert_edge_above(newEdge, edge->fBottom, c);  in split_edge()
931         } else if (p == edge->fBottom->fPoint || c.sweep_gt(p, edge->fBottom->fPoint)) {  in check_for_intersection()
932             split_edge(other, edge->fBottom, activeEdges, c, alloc);  in check_for_intersection()
933             v = edge->fBottom;  in check_for_intersection()
937         } else if (p == other->fBottom->fPoint || c.sweep_gt(p, other->fBottom->fPoint)) {  in check_for_intersection()
938             split_edge(edge, other->fBottom, activeEdges, c, alloc);  in check_for_intersection()
939             v = other->fBottom;  in check_for_intersection()
1199             LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,  in tessellate()
1204             LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,  in tessellate()
1281             LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,  in tessellate()