Searched refs:cubic (Results 1 - 25 of 58) sorted by relevance

123

/external/skia/tests/
H A DPathOpsCubicReduceOrderTest.cpp16 static bool controls_inside(const SkDCubic& cubic) {
17 return between(cubic[0].fX, cubic[1].fX, cubic[3].fX)
18 && between(cubic[0].fX, cubic[2].fX, cubic[3].fX)
19 && between(cubic[0].fY, cubic[1].fY, cubic[
108 const SkDCubic& cubic = pointDegenerates[index]; local
117 const SkDCubic& cubic = notPointDegenerates[index]; local
127 const SkDCubic& cubic = lines[index]; local
136 const SkDCubic& cubic = notLines[index]; local
145 const SkDCubic& cubic = modEpsilonLines[index]; local
154 const SkDCubic& cubic = lessEpsilonLines[index]; local
164 const SkDCubic& cubic = negEpsilonLines[index]; local
175 SkDCubic cubic = quad.toCubic(); local
185 SkDCubic cubic = quad.toCubic(); local
195 SkDCubic cubic = quad.toCubic(); local
[all...]
H A DPathOpsDCubicTest.cpp21 const SkDCubic& cubic = tests[index]; local
22 SkASSERT(ValidCubic(cubic));
23 bool result = cubic.clockwise();
H A DPathOpsCubicToQuadsTest.cpp19 const SkDCubic& cubic = cubics[index]; local
20 SkASSERT(ValidCubic(cubic));
21 double precision = cubic.calcPrecision();
23 CubicToQuads(cubic, precision, quads);
25 SkDebugf("%s [%d] cubic to quadratics failed count=%d\n", name, static_cast<int>(index),
37 SkDCubic cubic = quad.toCubic(); local
38 double precision = cubic.calcPrecision();
40 CubicToQuads(cubic, precision, quads);
42 SkDebugf("%s [%d] cubic to quadratics failed count=%d\n", name, static_cast<int>(index),
53 const SkDCubic& cubic local
76 const SkDCubic& cubic = cubics[index][idx2]; local
174 const SkDCubic& cubic = locals[x]; local
[all...]
H A DPathOpsDRectTest.cpp82 const SkDCubic& cubic = cubicTests[index]; local
83 SkASSERT(ValidCubic(cubic));
84 rect.setRawBounds(cubic);
85 REPORTER_ASSERT(reporter, rect.fLeft == SkTMin(cubic[0].fX,
86 SkTMin(cubic[1].fX, SkTMin(cubic[2].fX, cubic[3].fX))));
87 REPORTER_ASSERT(reporter, rect.fTop == SkTMin(cubic[0].fY,
88 SkTMin(cubic[1].fY, SkTMin(cubic[
[all...]
H A DPathOpsLineParametetersTest.cpp43 const SkDCubic& cubic = tests[index]; local
44 SkASSERT(ValidCubic(cubic));
45 lineParameters.cubicEndPoints(cubic, 0, 3);
47 denormalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1);
48 denormalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
67 normalizedDistance[0] = lineParameters.controlPtDistance(cubic, 1);
68 normalizedDistance[1] = lineParameters.controlPtDistance(cubic, 2);
H A DPathOpsCubicLineIntersectionTest.cpp15 SkDCubic cubic; member in struct:lineCubic
46 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; local
47 SkASSERT(ValidCubic(cubic));
52 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
55 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
64 int roots = i.intersect(cubic, line);
67 SkDPoint xy1 = cubic.ptAtT(tt1);
90 const SkDCubic& cubic = lineCubicTests[iIndex].cubic; local
[all...]
H A DPathOpsTestCommon.h15 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads);
17 bool ValidCubic(const SkDCubic& cubic);
H A DPathOpsCubicQuadIntersectionTest.cpp15 SkDCubic cubic; member in struct:lineCubic
56 const SkDCubic& cubic = quadCubicTests[index].cubic; local
57 SkASSERT(ValidCubic(cubic));
62 int order1 = reduce1.reduce(cubic, SkReduceOrder::kNo_Quadratics);
65 SkDebugf("[%d] cubic order=%d\n", iIndex, order1);
73 int roots = i.intersect(cubic, quad);
77 SkDPoint xy1 = cubic.ptAtT(tt1);
H A DPathOpsTestCommon.cpp14 void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads) { argument
16 cubic.toQuadraticTs(precision, &ts);
18 SkDQuad quad = cubic.toQuad();
25 SkDCubic part = cubic.subDivide(tStart, tEnd);
49 bool ValidCubic(const SkDCubic& cubic) {
51 if (!ValidPoint(cubic[index])) {
/external/chromium_org/third_party/skia/src/pathops/
H A DSkReduceOrder.cpp60 // note that three points in a line doesn't simplify a cubic
109 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { argument
110 reduction[0] = reduction[1] = cubic[0];
118 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) { argument
119 reduction[0] = cubic[0];
120 reduction[1] = cubic[3];
124 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) { argument
125 reduction[0] = cubic[0];
126 reduction[1] = cubic[3];
131 static int check_quadratic(const SkDCubic& cubic, SkDCubi argument
157 check_linear(const SkDCubic& cubic, int minX, int maxX, int minY, int maxY, SkDCubic& reduction) argument
203 reduce(const SkDCubic& cubic, Quadratics allowQuadratics) argument
275 SkDCubic cubic; local
[all...]
H A DSkPathOpsCubic.h40 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D);
48 SkDCubic cubic; local
49 cubic.set(a);
50 return cubic.findInflections(tValues);
63 SkDCubic cubic; local
64 cubic.set(a);
65 return cubic.subDivide(t1, t2);
72 SkDCubic cubic; local
73 cubic.set(pts);
74 cubic
[all...]
H A DSkPathOpsBounds.cpp13 SkDCubic cubic; local
14 cubic.set(a);
16 dRect.setBounds(cubic);
H A DSkPathOpsCurve.h27 SkDCubic cubic; local
28 cubic.set(a);
29 return cubic.ptAtT(t);
71 SkDCubic cubic; local
72 cubic.set(a);
73 return cubic.dxdyAtT(t);
110 SkDCubic cubic; local
111 cubic.set(a);
112 SkDPoint topPt = cubic.top(startT, endT);
138 SkDCubic cubic; local
[all...]
H A DSkIntersections.h54 int cubic(const SkPoint a[4]) { function in class:SkIntersections
55 SkDCubic cubic; local
56 cubic.set(a);
58 return intersect(cubic);
72 SkDCubic cubic; local
73 cubic.set(a);
75 return horizontal(cubic, left, right, y, flipped);
79 SkDCubic cubic; local
80 cubic.set(a);
82 return vertical(cubic, to
86 SkDCubic cubic; local
95 SkDCubic cubic; local
[all...]
H A DSkReduceOrder.h22 int reduce(const SkDCubic& cubic, Quadratics);
H A DSkDCubicToQuads.cpp2 http://stackoverflow.com/questions/2009160/how-do-i-convert-the-2-control-points-of-a-cubic-curve-to-the-single-control-poi
6 Let's call the control points of the cubic Q0..Q3 and the control points of the quadratic P0..P2.
18 If this is a degree-elevated cubic, then both equations will give the same answer for P1. Since
26 mid-point approx of cubic: a quad that shares the same anchors with the cubic and has the
32 Compute the Tdiv as the root of (cubic) equation
34 if Tdiv < 0.5 divide the cubic at Tdiv. First segment [0..Tdiv] can be approximated with by a
37 0.5<=Tdiv<1 - simply divide the cubic in two. The two halves can be approximated by the mid-point
39 Tdiv>=1 - the entire cubic can be approximated by the mid-point approximation
57 static double calc_t_div(const SkDCubic& cubic, doubl argument
91 add_simple_ts(const SkDCubic& cubic, double precision, SkTArray<double, true>* ts) argument
103 addTs(const SkDCubic& cubic, double precision, double start, double end, SkTArray<double, true>* ts) argument
[all...]
/external/skia/src/pathops/
H A DSkReduceOrder.cpp60 // note that three points in a line doesn't simplify a cubic
109 static int coincident_line(const SkDCubic& cubic, SkDCubic& reduction) { argument
110 reduction[0] = reduction[1] = cubic[0];
118 static int vertical_line(const SkDCubic& cubic, SkDCubic& reduction) { argument
119 reduction[0] = cubic[0];
120 reduction[1] = cubic[3];
124 static int horizontal_line(const SkDCubic& cubic, SkDCubic& reduction) { argument
125 reduction[0] = cubic[0];
126 reduction[1] = cubic[3];
131 static int check_quadratic(const SkDCubic& cubic, SkDCubi argument
157 check_linear(const SkDCubic& cubic, int minX, int maxX, int minY, int maxY, SkDCubic& reduction) argument
203 reduce(const SkDCubic& cubic, Quadratics allowQuadratics) argument
275 SkDCubic cubic; local
[all...]
H A DSkPathOpsCubic.h40 static void Coefficients(const double* cubic, double* A, double* B, double* C, double* D);
48 SkDCubic cubic; local
49 cubic.set(a);
50 return cubic.findInflections(tValues);
63 SkDCubic cubic; local
64 cubic.set(a);
65 return cubic.subDivide(t1, t2);
72 SkDCubic cubic; local
73 cubic.set(pts);
74 cubic
[all...]
H A DSkPathOpsBounds.cpp13 SkDCubic cubic; local
14 cubic.set(a);
16 dRect.setBounds(cubic);
H A DSkPathOpsCurve.h27 SkDCubic cubic; local
28 cubic.set(a);
29 return cubic.ptAtT(t);
71 SkDCubic cubic; local
72 cubic.set(a);
73 return cubic.dxdyAtT(t);
110 SkDCubic cubic; local
111 cubic.set(a);
112 SkDPoint topPt = cubic.top(startT, endT);
138 SkDCubic cubic; local
[all...]
H A DSkIntersections.h54 int cubic(const SkPoint a[4]) { function in class:SkIntersections
55 SkDCubic cubic; local
56 cubic.set(a);
58 return intersect(cubic);
72 SkDCubic cubic; local
73 cubic.set(a);
75 return horizontal(cubic, left, right, y, flipped);
79 SkDCubic cubic; local
80 cubic.set(a);
82 return vertical(cubic, to
86 SkDCubic cubic; local
95 SkDCubic cubic; local
[all...]
H A DSkReduceOrder.h22 int reduce(const SkDCubic& cubic, Quadratics);
/external/chromium_org/third_party/skia/src/utils/win/
H A DSkDWriteGeometrySink.cpp90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { argument
91 float dx10 = cubic[1].x - cubic[0].x;
92 float dx23 = cubic[2].x - cubic[3].x;
93 float midX = cubic[0].x + dx10 * 3 / 2;
94 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2)
96 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) {
99 float dy10 = cubic[1].y - cubic[
118 Cubic cubic = { { prevPt.x, prevPt.y }, local
[all...]
/external/skia/src/utils/win/
H A DSkDWriteGeometrySink.cpp90 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) { argument
91 float dx10 = cubic[1].x - cubic[0].x;
92 float dx23 = cubic[2].x - cubic[3].x;
93 float midX = cubic[0].x + dx10 * 3 / 2;
94 //NOTE: !approximately_equal(midX - cubic[3].x, dx23 * 3 / 2)
96 if (!approximately_equal(midX, (dx23 * 3 / 2) + cubic[3].x)) {
99 float dy10 = cubic[1].y - cubic[
118 Cubic cubic = { { prevPt.x, prevPt.y }, local
[all...]
/external/chromium_org/third_party/WebKit/Source/core/svg/
H A DSVGPathSegListSource.cpp101 SVGPathSegCurvetoCubic* cubic = static_cast<SVGPathSegCurvetoCubic*>(m_segment.get()); local
102 point1 = FloatPoint(cubic->x1(), cubic->y1());
103 point2 = FloatPoint(cubic->x2(), cubic->y2());
104 targetPoint = FloatPoint(cubic->x(), cubic->y());

Completed in 275 milliseconds

123