Lines Matching refs:curve

59     // temporary storage for the current curve
142 // fullCurve is true iff the curve in pts has not been split.
223 // that contains the curve we want to dash in the first type elements
233 int curCurveoff = 0; // initially the current curve is at curCurvepts[0...type]
262 private static boolean pointCurve(float[] curve, int type) {
264 if (curve[i] != curve[i-2]) {
272 // t values where the left side of the curve has a specified length.
273 // It does this by subdividing the input curve until a certain error
278 // through the tree when we need the next subdivided curve). This saves
287 // (i.e. the original curve) is at recCurveStack[0] (but then it
289 // only the right half of the original curve is at 0)
322 // a curve, we want it to fail ASAP.
391 // valid flattened curve, this would be >= 0.
393 // returns the t value where the remaining curve should be split in
394 // order for the left subdivided curve to have length len. If len
395 // is >= than the length of the uniterated curve, it returns 1.
410 // if the acceleration in this section of the curve is small enough.
413 // left with a, b, c which define a 1D Bezier curve. We then
447 // of the original curve.
455 // curve, so lastSegLen won't be too high. In cases where len
456 // overshoots the curve, this method will exit in the while
510 float[] curve = recCurveStack[recLevel];
513 float x0 = curve[0], y0 = curve[1];
515 final float x1 = curve[i], y1 = curve[i+1];
523 final float lineLen = Helpers.linelen(curve[0], curve[1], curve[curveType-2], curve[curveType-1]);