- for(int i=0; i<gp->GetNumPoints(poly); i++)
- {
- if (gp->GetOnCurve(poly, i))
- {
-// p.drawLine(x, y, gp->GetX(poly, i), gp->GetY(poly, i));
- x = (int)gp->GetX(poly, i), y = (int)gp->GetY(poly, i);
- path->lineTo(x, y);
- }
- else
- {
- IPoint pt = (gp->GetOnCurve(poly, gp->GetNext(poly, i)) ? gp->GetNextPoint(poly, i) : gp->GetMidpointToNext(poly, i));
-
- path->quadTo(gp->GetX(poly, i), gp->GetY(poly, i), pt.x, pt.y);
- x = pt.x, y = pt.y;
-
- // If following point is on curve, move past it
- if (gp->GetOnCurve(poly, gp->GetNext(poly, i)))
- i++;
- }
+ path->quadTo(gp->GetX(poly, i), gp->GetY(poly, i), pt.x, pt.y);