Searched refs:cubic (Results 101 - 125 of 143) sorted by relevance

123456

/external/skia/tests/
H A DPathOpsCubicIntersectionTest.cpp560 const SkDCubic& cubic = selfSet[index]; local
564 int ts = cubic.findMaxCurvature(max);
567 max[idx2], cubic.ptAtT(max[idx2]).fX, cubic.ptAtT(max[idx2]).fY);
571 cubic.toQuadraticTs(cubic.calcPrecision(), &ts1);
575 CubicToQuads(cubic, cubic.calcPrecision(), quads1);
584 int result = i.intersect(cubic);
588 SkDPoint pt1 = cubic
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkDCubicIntersection.cpp26 static const int kCubicToQuadSubdivisionDepth = 8; // slots reserved for cubic to quads subdivision
28 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) { argument
29 SkDCubic part = cubic.subDivide(tStart, tEnd);
35 SkDebugf("%s cubic=(%1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g)"
36 " t=(%1.9g,%1.9g)\n", __FUNCTION__, cubic[0].fX, cubic[0].fY,
37 cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[
[all...]
H A DSkAddIntersections.cpp419 int pts = ts.cubic(wt.pts());
/external/skia/src/pathops/
H A DSkDCubicIntersection.cpp26 static const int kCubicToQuadSubdivisionDepth = 8; // slots reserved for cubic to quads subdivision
28 static int quadPart(const SkDCubic& cubic, double tStart, double tEnd, SkReduceOrder* reducer) { argument
29 SkDCubic part = cubic.subDivide(tStart, tEnd);
35 SkDebugf("%s cubic=(%1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g %1.9g,%1.9g)"
36 " t=(%1.9g,%1.9g)\n", __FUNCTION__, cubic[0].fX, cubic[0].fY,
37 cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[
[all...]
/external/chromium_org/third_party/WebKit/Source/core/animation/
H A DCompositorAnimations.cpp316 const CubicBezierTimingFunction* cubic = toCubicBezierTimingFunction(timingFunction); local
318 if (cubic->subType() == CubicBezierTimingFunction::Custom) {
319 curve.add(keyframe, cubic->x1(), cubic->y1(), cubic->x2(), cubic->y2());
323 switch (cubic->subType()) {
/external/chromium_org/third_party/skia/src/core/
H A DSkGeometry.h91 convert it into the cubic fitting the same curve. The new cubic
103 /** Set pt to the point on the src cubic specified by t. t must be
109 /** Given a src cubic bezier, chop it at the specified t value,
114 /** Given a src cubic bezier, chop it at the specified t values,
121 /** Given a src cubic bezier, chop it at the specified t == 1/2,
126 /** Given the 4 coefficients for a cubic bezier (either X or Y values), look
128 these extrema. If the cubic has no extrema betwee (0..1) exclusive, the
138 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
141 0 dst[0..3] is the original cubic
[all...]
H A DSkGeometry.cpp493 up with 1.0, hence the need to check and just return the last cubic as
536 // have src point to the remaining cubic (after the chop)
543 // if we can't, just create a degenerate cubic
578 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
581 0 dst[0..3] is the original cubic
623 After some canceling of the cubic term, we get
883 bool SkXRayCrossesMonotonicCubic(const SkXRay& pt, const SkPoint cubic[4],
890 // first and last points since this cubic is monotonic
891 SkScalar min_y = SkMinScalar(cubic[0].fY, cubic[
[all...]
/external/skia/src/core/
H A DSkGeometry.h91 convert it into the cubic fitting the same curve. The new cubic
103 /** Set pt to the point on the src cubic specified by t. t must be
109 /** Given a src cubic bezier, chop it at the specified t value,
114 /** Given a src cubic bezier, chop it at the specified t values,
121 /** Given a src cubic bezier, chop it at the specified t == 1/2,
126 /** Given the 4 coefficients for a cubic bezier (either X or Y values), look
128 these extrema. If the cubic has no extrema betwee (0..1) exclusive, the
138 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
141 0 dst[0..3] is the original cubic
[all...]
H A DSkGeometry.cpp493 up with 1.0, hence the need to check and just return the last cubic as
536 // have src point to the remaining cubic (after the chop)
543 // if we can't, just create a degenerate cubic
578 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
581 0 dst[0..3] is the original cubic
623 After some canceling of the cubic term, we get
883 bool SkXRayCrossesMonotonicCubic(const SkXRay& pt, const SkPoint cubic[4],
890 // first and last points since this cubic is monotonic
891 SkScalar min_y = SkMinScalar(cubic[0].fY, cubic[
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicParameterization.cpp384 static void set_abcd(const double* cubic, double& a, double& b, double& c, argument
386 a = cubic[0]; // a = A
387 b = 3 * cubic[2]; // b = 3*B (compute rest of b lazily)
388 c = 3 * cubic[4]; // c = 3*C (compute rest of c lazily)
389 d = cubic[6]; // d = D
399 static void alt_set_abcd(const double* cubic, double& a, double& b, double& c, argument
401 a = cubic[0];
403 double q = 3 * cubic[2];
404 double r = 3 * cubic[4];
407 d = cubic[
501 tangent(const double* cubic, double t) argument
512 tangent(const Cubic& cubic, double t, _Point& result) argument
[all...]
H A DCubicIntersection_Test.cpp420 // FIXME: carry last subdivide and reduceOrder result with cubic
475 if (test == 12932) { // this exposes a weakness when one cubic touches the other but
740 const Cubic& cubic = selfSet[index]; local
744 int ts = find_cubic_max_curvature(cubic, max);
747 max[idx2], xy_at_t(cubic, max[idx2]).x, xy_at_t(cubic, max[idx2]).y);
751 cubic_to_quadratics(cubic, calcPrecision(cubic), ts1);
755 cubic_to_quadratics(cubic, calcPrecision(cubic), quads
[all...]
H A DEdgeWalker.cpp57 static const char* kLVerbStr[] = {"", "line", "quad", "cubic"};
140 const Cubic cubic = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}, {a[2].fX, a[2].fY}, local
143 xy_at_t(cubic, t, x, y);
163 const Cubic cubic = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}, {a[2].fX, a[2].fY}, local
166 xy_at_t(cubic, t, *(double*) 0, y);
1379 // FIXME: don't know what to do if verb is quad, cubic
1389 // assumes quad/cubic can already be upconverted to cubic/cubic
1519 SkPoint cubic[
[all...]
H A DSimplify.cpp110 static const char* kLVerbStr[] = {"", "line", "quad", "cubic"};
134 #define MAKE_CONST_CUBIC(cubic, pts) \
135 const Cubic cubic = {{pts[0].fX, pts[0].fY}, {pts[1].fX, pts[1].fY}, \
276 MAKE_CONST_CUBIC(cubic, a);
278 xy_at_t(cubic, t, x, y);
284 MAKE_CONST_CUBIC(cubic, a);
285 xy_at_t(cubic, t, out->x, out->y);
317 MAKE_CONST_CUBIC(cubic, a);
319 xy_at_t(cubic, t, x, *(double*) 0);
345 MAKE_CONST_CUBIC(cubic,
[all...]
H A DthingsToDo.txt8 add unit test for cubic horizontal intersection with left/right
10 does ActiveEdge::isCoincidentWith need to support quad, cubic?
13 add code to promote quad to cubic, or add quad/cubic intersection
/external/skia/experimental/Intersection/
H A DCubicParameterization.cpp384 static void set_abcd(const double* cubic, double& a, double& b, double& c, argument
386 a = cubic[0]; // a = A
387 b = 3 * cubic[2]; // b = 3*B (compute rest of b lazily)
388 c = 3 * cubic[4]; // c = 3*C (compute rest of c lazily)
389 d = cubic[6]; // d = D
399 static void alt_set_abcd(const double* cubic, double& a, double& b, double& c, argument
401 a = cubic[0];
403 double q = 3 * cubic[2];
404 double r = 3 * cubic[4];
407 d = cubic[
501 tangent(const double* cubic, double t) argument
512 tangent(const Cubic& cubic, double t, _Point& result) argument
[all...]
H A DCubicIntersection_Test.cpp420 // FIXME: carry last subdivide and reduceOrder result with cubic
475 if (test == 12932) { // this exposes a weakness when one cubic touches the other but
740 const Cubic& cubic = selfSet[index]; local
744 int ts = find_cubic_max_curvature(cubic, max);
747 max[idx2], xy_at_t(cubic, max[idx2]).x, xy_at_t(cubic, max[idx2]).y);
751 cubic_to_quadratics(cubic, calcPrecision(cubic), ts1);
755 cubic_to_quadratics(cubic, calcPrecision(cubic), quads
[all...]
H A DEdgeWalker.cpp57 static const char* kLVerbStr[] = {"", "line", "quad", "cubic"};
140 const Cubic cubic = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}, {a[2].fX, a[2].fY}, local
143 xy_at_t(cubic, t, x, y);
163 const Cubic cubic = {{a[0].fX, a[0].fY}, {a[1].fX, a[1].fY}, {a[2].fX, a[2].fY}, local
166 xy_at_t(cubic, t, *(double*) 0, y);
1379 // FIXME: don't know what to do if verb is quad, cubic
1389 // assumes quad/cubic can already be upconverted to cubic/cubic
1519 SkPoint cubic[
[all...]
H A DSimplify.cpp110 static const char* kLVerbStr[] = {"", "line", "quad", "cubic"};
134 #define MAKE_CONST_CUBIC(cubic, pts) \
135 const Cubic cubic = {{pts[0].fX, pts[0].fY}, {pts[1].fX, pts[1].fY}, \
276 MAKE_CONST_CUBIC(cubic, a);
278 xy_at_t(cubic, t, x, y);
284 MAKE_CONST_CUBIC(cubic, a);
285 xy_at_t(cubic, t, out->x, out->y);
317 MAKE_CONST_CUBIC(cubic, a);
319 xy_at_t(cubic, t, x, *(double*) 0);
345 MAKE_CONST_CUBIC(cubic,
[all...]
H A DthingsToDo.txt8 add unit test for cubic horizontal intersection with left/right
10 does ActiveEdge::isCoincidentWith need to support quad, cubic?
13 add code to promote quad to cubic, or add quad/cubic intersection
/external/chromium_org/third_party/WebKit/Source/platform/animation/
H A DTimingFunction.cpp38 return "cubic-bezier(" + String::numberToStringECMAScript(this->x1()) + ", " +
54 // This works by taking taking the derivative of the cubic bezier, on the y
204 const CubicBezierTimingFunction& cubic = toCubicBezierTimingFunction(lhs); local
205 return (cubic == rhs);
/external/chromium_org/third_party/skia/samplecode/
H A DSamplePatch.cpp69 static void eval_patch_edge(const SkPoint cubic[], SkPoint samples[], int segs) { argument
73 samples[0] = cubic[0];
76 SkEvalCubicAt(cubic, t, &samples[i], NULL, NULL);
/external/skia/samplecode/
H A DSamplePatch.cpp69 static void eval_patch_edge(const SkPoint cubic[], SkPoint samples[], int segs) { argument
73 samples[0] = cubic[0];
76 SkEvalCubicAt(cubic, t, &samples[i], NULL, NULL);
/external/chromium_org/chrome/browser/resources/security_warnings/
H A Dinterstitial_v2.css32 transition: box-shadow 200ms cubic-bezier(0.4, 0, 0.2, 1);
/external/chromium_org/third_party/skia/src/gpu/
H A DGrPathUtils.cpp341 // a is the first control point of the cubic.
346 // this assumes that the cubic doesn't inflect and is simple
410 // likely to hit the max subdivision count. However, in this case the cubic is approaching a
411 // line and the accuracy of the quad point isn't so important. We check if the two middle cubic
542 SkPoint* cubic = chopped + 3*i; local
543 convert_noninflect_cubic_to_quads(cubic, tolSqd, constrainWithinTangents, dir, quads);
706 // For the case when a cubic is actually a quadratic
812 // Set klm_rev to to match the sub_section of cubic that needs to have its orientation
/external/skia/src/gpu/
H A DGrPathUtils.cpp341 // a is the first control point of the cubic.
346 // this assumes that the cubic doesn't inflect and is simple
410 // likely to hit the max subdivision count. However, in this case the cubic is approaching a
411 // line and the accuracy of the quad point isn't so important. We check if the two middle cubic
542 SkPoint* cubic = chopped + 3*i; local
543 convert_noninflect_cubic_to_quads(cubic, tolSqd, constrainWithinTangents, dir, quads);
706 // For the case when a cubic is actually a quadratic
812 // Set klm_rev to to match the sub_section of cubic that needs to have its orientation

Completed in 589 milliseconds

123456