Lines Matching refs:curve
70 // temporary storage for the current curve
360 // that contains the curve we want to dash in the first type elements
367 // initially the current curve is at curCurvepts[0...type]
400 private static boolean pointCurve(float[] curve, int type) {
402 if (curve[i] != curve[i-2]) {
410 // t values where the left side of the curve has a specified length.
411 // It does this by subdividing the input curve until a certain error
416 // through the tree when we need the next subdivided curve). This saves
425 // (i.e. the original curve) is at recCurveStack[0] (but then it
427 // only the right half of the original curve is at 0)
454 // on a curve, we want it to fail ASAP.
544 // valid flattened curve, this would be >= 0.
547 // returns the t value where the remaining curve should be split in
548 // order for the left subdivided curve to have length len. If len
549 // is >= than the length of the uniterated curve, it returns 1.
564 // if the acceleration in this section of the curve is small enough.
567 // left with a, b, c which define a 1D Bezier curve. We then
602 // of the original curve.
610 // curve, so lastSegLen won't be too high. In cases where len
611 // overshoots the curve, this method will exit in the while
673 float[] curve = recCurveStack[recLevel];
676 float x0 = curve[0], y0 = curve[1];
678 final float x1 = curve[i], y1 = curve[i+1];
686 final float lineLen = Helpers.linelen(curve[0], curve[1],
687 curve[curveType-2],
688 curve[curveType-1]);