Lines Matching full:points
38 uint32_t GrPathUtils::quadraticPointCount(const SkPoint points[],
45 SkScalar d = points[1].distanceToLineSegmentBetween(points[0], points[2]);
51 // points.
74 SkPoint** points,
78 (*points)[0] = p2;
79 *points += 1;
90 uint32_t a = generateQuadraticPoints(p0, q[0], r, tolSqd, points, pointsLeft);
91 uint32_t b = generateQuadraticPoints(r, q[1], p2, tolSqd, points, pointsLeft);
95 uint32_t GrPathUtils::cubicPointCount(const SkPoint points[],
103 points[1].distanceToLineSegmentBetweenSqd(points[0], points[3]),
104 points[2].distanceToLineSegmentBetweenSqd(points[0], points[3]));
131 SkPoint** points,
136 (*points)[0] = p3;
137 *points += 1;
151 uint32_t a = generateCubicPoints(p0, q[0], r[0], s, tolSqd, points, pointsLeft);
152 uint32_t b = generateCubicPoints(s, r[1], q[2], p3, tolSqd, points, pointsLeft);
429 // control points are very close to the baseline vector. If so then we just pick quadratic
430 // points on the control polygon.
457 // Insert two quadratics to cover the case when ab points away from d and/or dc
458 // points away from a.
581 // Where P is matrix of control points
583 // k is vector of values of K evaluated at the control points