Lines Matching defs:edge1
45 Edge edge1 = InitEdge(p1, p2);
50 while (edge1.curPoint.y <= p3.y) {
51 // change edge1 from p1-p2 to p2-p3
52 if (edge1.curPoint.y == p2.y) {
53 edge1 = InitEdge(p2, p3);
54 if (edge1.dPoint.y == 0) {
59 area.SetLeft(MATH_MIN(edge1.curPoint.x, edge2.curPoint.x));
60 area.SetRight(MATH_MAX(edge1.curPoint.x, edge2.curPoint.x));
61 area.SetTop(MATH_MIN(edge1.curPoint.y, edge2.curPoint.y));
62 area.SetBottom(MATH_MAX(edge1.curPoint.y, edge2.curPoint.y));
65 while (edge1.curPoint.y == lastY) {
66 // use Bresenham algorithm to get next point on edge1
67 StepToNextPointOnEdge(edge1);
73 lastY = edge1.curPoint.y;