Lines Matching refs:points
32 // We guarantee that no quad or cubic will ever produce more than this many points
44 uint32_t quadraticPointCount(const SkPoint points[], SkScalar tol);
46 // Returns the number of points actually written to 'points', will be <= to 'pointsLeft'
51 SkPoint** points,
57 uint32_t cubicPointCount(const SkPoint points[], SkScalar tol);
59 // Returns the number of points actually written to 'points', will be <= to 'pointsLeft'
65 SkPoint** points,
69 // quad. The matrix is determined by the control points of the quadratic.
107 // Input is 3 control points and a weight for a bezier conic. Calculates the three linear
119 // set based on stretchiness of the matrix. The result is sets of 3 points in quads. This will
127 // path where all the control points taken together form a convex polygon. It relies on this
164 // - If the cubic is "serpentine", then the T values are any inflection points in [0 < T < 1].
165 // - If the cubic is linear, then the T values are any 180-degree cusp points in [0 < T < 1].
169 // point(s) occurred at 180-degree turnaround points on a degenerate flat line.