Lines Matching defs:fBottom

237         , fBottom(bottom)
250 Vertex* fBottom; // The bottom vertex in vertex-sort-order.
272 fDX = static_cast<double>(fBottom->fPoint.fX) - fTop->fPoint.fX;
273 fDY = static_cast<double>(fBottom->fPoint.fY) - fTop->fPoint.fY;
274 fC = static_cast<double>(fTop->fPoint.fY) * fBottom->fPoint.fX -
275 static_cast<double>(fTop->fPoint.fX) * fBottom->fPoint.fY;
279 fTop->fID, fBottom->fID,
280 other.fTop->fID, other.fBottom->fID);
281 if (fTop == other.fTop || fBottom == other.fBottom) {
645 LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
651 LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID);
682 (c.sweep_lt(edge->fBottom->fPoint, next->fBottom->fPoint) &&
683 next->isRightOf(edge->fBottom)) ||
684 (c.sweep_lt(next->fBottom->fPoint, edge->fBottom->fPoint) &&
685 edge->isLeftOf(next->fBottom))) {
697 if (edge->fBottom->fProcessed || !edge->fTop->fProcessed) {
700 } else if (edge->fTop->fProcessed && !edge->fBottom->fProcessed) {
709 if (edge->fTop->fPoint == edge->fBottom->fPoint ||
710 c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {
713 LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);
727 if (edge->fTop->fPoint == edge->fBottom->fPoint ||
728 c.sweep_gt(edge->fTop->fPoint, edge->fBottom->fPoint)) {
731 LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID);
735 if (next->isRightOf(edge->fBottom)) {
745 LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
746 edge->fBottom->fID);
748 edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove);
752 LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID,
762 LOG("erasing edge (%g -> %g)\n", edge->fTop->fID, edge->fBottom->fID);
783 edge->fBottom = v;
794 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY);
811 if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) {
814 edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY);
819 } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) {
822 set_top(other, edge->fBottom, activeEdges, c);
826 set_top(edge, other->fBottom, activeEdges, c);
838 if (edge->fPrevEdgeBelow && (edge->fBottom == edge->fPrevEdgeBelow->fBottom ||
839 !edge->fPrevEdgeBelow->isLeftOf(edge->fBottom))) {
841 } else if (edge->fNextEdgeBelow && (edge->fBottom == edge->fNextEdgeBelow->fBottom ||
842 !edge->isLeftOf(edge->fNextEdgeBelow->fBottom))) {
851 Vertex* bottom = edge->fBottom;
854 Vertex* leftBottom = edge->fLeft->fBottom;
868 Vertex* rightBottom = edge->fRight->fBottom;
885 edge->fTop->fID, edge->fBottom->fID,
889 } else if (c.sweep_gt(v->fPoint, edge->fBottom->fPoint)) {
892 Edge* newEdge = ALLOC_NEW(Edge, (v, edge->fBottom, edge->fWinding), alloc);
894 insert_edge_above(newEdge, edge->fBottom, c);
930 } else if (p == edge->fBottom->fPoint || c.sweep_gt(p, edge->fBottom->fPoint)) {
931 split_edge(other, edge->fBottom, activeEdges, c, alloc);
932 v = edge->fBottom;
936 } else if (p == other->fBottom->fPoint || c.sweep_gt(p, other->fBottom->fPoint)) {
937 split_edge(edge, other->fBottom, activeEdges, c, alloc);
938 v = other->fBottom;
1198 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
1203 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,
1280 LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID,