java2d/marlin/Stroker.java

38     private static final int DRAWING_OP_TO = 1; // ie. curve, line, or quad
110     // This is where the curve to be processed is put. We give it
120     // dirty curve
121     final Curve curve;
131         this.curve = rdrCtx.curve;
254         // need 1 curve to approximate the circle section that joins omx,omy
307             // just return to avoid generating a flat curve:
313         // define the bezier curve we're computing.
681         // a curve with a cusp. What happens is that curveTo splits
682         // the input curve at the cusp, and passes it to this function.
710         // if p2-p1 and p4-p3 are parallel, that must mean this curve is a line
720 //      offset curve (call it I) of the input curve B using a bezier curve Bp.
723 //      1. The computed curve Bp should go through I(0) and I(1). These are
737 //      is true for any bezier curve; therefore, we get the equations
773         // for any bezier curve the vectors p2-p1 and p4-p3 are parallel to
826     // return the kind of curve in the right and left arrays.
842         // a curve with a cusp. What happens is that curveTo splits
843         // the input curve at the cusp, and passes it to this function.
856         // if p2-p1 and p4-p3 are parallel, that must mean this curve is a line
866         // for any bezier curve the vectors p2-p1 and p4-p3 are parallel to
887     // finds values of t where the curve in pts should be subdivided in order
888     // to get good offset curves a distance of w away from the middle curve.
895         // if the curve is already parallel to either axis we gain nothing
983             // this happens if the "curve" is just a point
1004         final int nSplits = findSubdivPoints(curve, mid, subdivTs, 8, lineWidth2);
1064             // this happens if the "curve" is just a point
1084         int nSplits = findSubdivPoints(curve, mid, subdivTs, 6, lineWidth2);
1130     // a stack of polynomial curves where each curve shares endpoints with