java2d/marlin/DStroker.java

36     private static final int DRAWING_OP_TO = 1; // ie. curve, line, or quad
108     // This is where the curve to be processed is put. We give it
118     // dirty curve
119     final DCurve curve;
129         this.curve = rdrCtx.curve;
252         // need 1 curve to approximate the circle section that joins omx,omy
305             // just return to avoid generating a flat curve:
311         // define the bezier curve we're computing.
679         // a curve with a cusp. What happens is that curveTo splits
680         // the input curve at the cusp, and passes it to this function.
708         // if p2-p1 and p4-p3 are parallel, that must mean this curve is a line
718 //      offset curve (call it I) of the input curve B using a bezier curve Bp.
721 //      1. The computed curve Bp should go through I(0) and I(1). These are
735 //      is true for any bezier curve; therefore, we get the equations
771         // for any bezier curve the vectors p2-p1 and p4-p3 are parallel to
824     // return the kind of curve in the right and left arrays.
840         // a curve with a cusp. What happens is that curveTo splits
841         // the input curve at the cusp, and passes it to this function.
854         // if p2-p1 and p4-p3 are parallel, that must mean this curve is a line
864         // for any bezier curve the vectors p2-p1 and p4-p3 are parallel to
885     // finds values of t where the curve in pts should be subdivided in order
886     // to get good offset curves a distance of w away from the middle curve.
893         // if the curve is already parallel to either axis we gain nothing
981             // this happens if the "curve" is just a point
1002         final int nSplits = findSubdivPoints(curve, mid, subdivTs, 8, lineWidth2);
1062             // this happens if the "curve" is just a point
1082         int nSplits = findSubdivPoints(curve, mid, subdivTs, 6, lineWidth2);
1128     // a stack of polynomial curves where each curve shares endpoints with