| /external/skia/src/pathops/ |
| SkDCubicToQuads.cpp | 2 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, double precision, double start)
[all...] |
| SkPathOpsQuad.cpp | 147 SkDCubic cubic; local
148 cubic[0] = fPts[0];
149 cubic[2] = fPts[1];
150 cubic[3] = fPts[2];
151 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3;
152 cubic[1].fY = (cubic[0].fY + cubic[2].fY * 2) / 3
[all...] |
| SkPathOpsRect.cpp | 60 void SkDRect::setRawBounds(const SkDCubic& cubic) {
61 set(cubic[0]);
63 add(cubic[x]);
|
| SkDCubicLineIntersection.cpp | 12 Find the interection of a line and cubic by solving for valid t values.
14 Analogous to line-quadratic intersection, solve line-cubic intersection by
15 representing the cubic as:
23 Then using Mathematica, solve for the values of t where the cubic intersects the
53 instead, use Numeric Solutions recipe to solve the cubic.
237 // FIXME: see if line end is nearly on cubic
263 // FIXME: see if line end is nearly on cubic
300 int SkIntersections::horizontal(const SkDCubic& cubic, double left, double right, double y,
303 LineCubicIntersections c(cubic, line, this);
307 int SkIntersections::vertical(const SkDCubic& cubic, double top, double bottom, double x
[all...] |
| SkIntersections.cpp | 46 SkDCubic cubic; local
47 cubic.set(pts);
48 return intersectRay(cubic, line);
186 SkDCubic cubic; local
187 cubic.set(a);
188 return vertical(cubic, top, bottom, x, flipped);
|
| SkDCubicIntersection.cpp | 26 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) {
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[2].fY
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsQuad.cpp | 147 SkDCubic cubic; local
148 cubic[0] = fPts[0];
149 cubic[2] = fPts[1];
150 cubic[3] = fPts[2];
151 cubic[1].fX = (cubic[0].fX + cubic[2].fX * 2) / 3;
152 cubic[1].fY = (cubic[0].fY + cubic[2].fY * 2) / 3
[all...] |
| SkPathOpsRect.cpp | 60 void SkDRect::setRawBounds(const SkDCubic& cubic) {
61 set(cubic[0]);
63 add(cubic[x]);
|
| SkDCubicLineIntersection.cpp | 12 Find the interection of a line and cubic by solving for valid t values.
14 Analogous to line-quadratic intersection, solve line-cubic intersection by
15 representing the cubic as:
23 Then using Mathematica, solve for the values of t where the cubic intersects the
53 instead, use Numeric Solutions recipe to solve the cubic.
237 // FIXME: see if line end is nearly on cubic
263 // FIXME: see if line end is nearly on cubic
300 int SkIntersections::horizontal(const SkDCubic& cubic, double left, double right, double y,
303 LineCubicIntersections c(cubic, line, this);
307 int SkIntersections::vertical(const SkDCubic& cubic, double top, double bottom, double x
[all...] |
| SkIntersections.cpp | 46 SkDCubic cubic; local
47 cubic.set(pts);
48 return intersectRay(cubic, line);
186 SkDCubic cubic; local
187 cubic.set(a);
188 return vertical(cubic, top, bottom, x, flipped);
|
| SkDCubicIntersection.cpp | 26 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) {
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[2].fY
[all...] |
| SkAddIntersections.cpp | 398 int pts = ts.cubic(wt.pts());
|
| /external/chromium_org/third_party/skia/src/pdf/ |
| SkPDFUtils.cpp | 154 SkPoint cubic[4]; local
155 SkConvertQuadToCubic(args, cubic);
156 AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY,
157 cubic[3].fX, cubic[3].fY, ¤tSegment);
|
| /external/skia/src/pdf/ |
| SkPDFUtils.cpp | 154 SkPoint cubic[4]; local
155 SkConvertQuadToCubic(args, cubic);
156 AppendCubic(cubic[1].fX, cubic[1].fY, cubic[2].fX, cubic[2].fY,
157 cubic[3].fX, cubic[3].fY, ¤tSegment);
|
| /external/skia/tests/ |
| GeometryTest.cpp | 51 const SkPoint cubic[] = { local
58 REPORTER_ASSERT(reporter, nearly_equal(cubic[i], dst[i]));
|
| PathOpsCubicIntersectionTest.cpp | 528 const SkDCubic& cubic = selfSet[index]; local
532 int ts = cubic.findMaxCurvature(max);
535 max[idx2], cubic.ptAtT(max[idx2]).fX, cubic.ptAtT(max[idx2]).fY);
539 cubic.toQuadraticTs(cubic.calcPrecision(), &ts1);
543 CubicToQuads(cubic, cubic.calcPrecision(), quads1);
552 int result = i.intersect(cubic);
556 SkDPoint pt1 = cubic.ptAtT(i[0][0])
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkGeometry.h | 91 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...] |
| /external/skia/include/core/ |
| SkGeometry.h | 91 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...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkGeometry.cpp | 548 /** Cubic'(t) = At^2 + Bt + C, where
602 up with 1.0, hence the need to check and just return the last cubic as
647 // have src point to the remaining cubic (after the chop)
654 // if we can't, just create a degenerate cubic
691 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
694 0 dst[0..3] is the original cubic
736 After some canceling of the cubic term, we get
1074 bool SkXRayCrossesMonotonicCubic(const SkXRay& pt, const SkPoint cubic[4], bool* ambiguous) {
1080 // first and last points since this cubic is monotonic
1081 SkScalar min_y = SkMinScalar(cubic[0].fY, cubic[3].fY)
[all...] |
| /external/skia/src/core/ |
| SkGeometry.cpp | 548 /** Cubic'(t) = At^2 + Bt + C, where
602 up with 1.0, hence the need to check and just return the last cubic as
647 // have src point to the remaining cubic (after the chop)
654 // if we can't, just create a degenerate cubic
691 /** Given 4 points on a cubic bezier, chop it into 1, 2, 3 beziers such that
694 0 dst[0..3] is the original cubic
736 After some canceling of the cubic term, we get
1074 bool SkXRayCrossesMonotonicCubic(const SkXRay& pt, const SkPoint cubic[4], bool* ambiguous) {
1080 // first and last points since this cubic is monotonic
1081 SkScalar min_y = SkMinScalar(cubic[0].fY, cubic[3].fY)
[all...] |
| /external/jmonkeyengine/engine/src/ogre/com/jme3/scene/plugins/ogre/ |
| MaterialLoader.java | 124 boolean cubic = false;
128 if (type != null && type.equals("cubic")){
129 cubic = true;
134 texKey.setAsCube(cubic);
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrPathUtils.cpp | 280 // a is the first control point of the cubic.
285 // this assumes that the cubic doesn't inflect and is simple
349 // the max subdivision count. However, in this case the cubic is approaching a line and the
350 // accuracy of the quad point isn't so important. We check if the two middle cubic control
474 SkPoint* cubic = chopped + 3*i; local
475 convert_noninflect_cubic_to_quads(cubic, tolSqd, constrainWithinTangents, dir, quads);
|
| /external/skia/src/gpu/ |
| GrPathUtils.cpp | 280 // a is the first control point of the cubic.
285 // this assumes that the cubic doesn't inflect and is simple
349 // the max subdivision count. However, in this case the cubic is approaching a line and the
350 // accuracy of the quad point isn't so important. We check if the two middle cubic control
474 SkPoint* cubic = chopped + 3*i; local
475 convert_noninflect_cubic_to_quads(cubic, tolSqd, constrainWithinTangents, dir, quads);
|
| /frameworks/base/core/java/android/widget/ |
| StackView.java | [all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/recent/ |
| RecentsPanelView.java | 557 final TimeInterpolator cubic = new DecelerateInterpolator(1.5f); local
564 .setDuration(duration).setInterpolator(cubic);
[all...] |
