HomeSort by relevance Sort by last modified time
    Searched full:subdivide (Results 1 - 25 of 56) sorted by null

1 2 3

  /external/chromium_org/third_party/skia/src/pathops/
SkPathOpsCubic.h 60 SkDCubic subDivide(double t1, double t2) const;
62 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
65 return cubic.subDivide(t1, t2);
68 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
70 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1,
74 cubic.subDivide(a, d, t1, t2, p);
SkPathOpsQuad.h 49 SkDQuad subDivide(double t1, double t2) const;
50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) {
53 return quad.subDivide(t1, t2);
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const;
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
60 return quad.subDivide(a, c, t1, t2);
SkPathOpsLine.h 23 static SkDLine SubDivide(const SkPoint a[2], double t1, double t2) {
26 return line.subDivide(t1, t2);
39 SkDLine subDivide(double t1, double t2) const;
SkDQuadIntersection.cpp 121 SkIntersections* i, bool* subDivide) {
133 if (subDivide) {
134 *subDivide = true;
150 double t2s, double t2e, SkIntersections* i, bool* subDivide) {
151 SkDQuad hull = q1.subDivide(t1s, t1e);
211 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) {
215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
219 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
225 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
    [all...]
SkPathOpsCurve.h 133 SkDQuad dst = quad.subDivide(startT, endT);
140 SkDCubic dst = cubic.subDivide(startT, endT);
SkDCubicToQuads.cpp 65 sub = cubic.subDivide(start, 1);
176 SkDCubic part = subDivide(0, inflectT[0]);
180 part = subDivide(inflectT[idx], inflectT[idx + 1]);
183 part = subDivide(inflectT[last], 1);
SkPathOpsQuad.cpp 51 SkDQuad sub = subDivide(startT, endT);
218 SkDQuad SkDQuad::subDivide(double t1, double t2) const {
240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const {
250 SkDQuad sub = subDivide(t1, t2);
  /external/skia/src/pathops/
SkPathOpsCubic.h 60 SkDCubic subDivide(double t1, double t2) const;
62 static SkDCubic SubDivide(const SkPoint a[4], double t1, double t2) {
65 return cubic.subDivide(t1, t2);
68 void subDivide(const SkDPoint& a, const SkDPoint& d, double t1, double t2, SkDPoint p[2]) const;
70 static void SubDivide(const SkPoint pts[4], const SkDPoint& a, const SkDPoint& d, double t1,
74 cubic.subDivide(a, d, t1, t2, p);
SkPathOpsQuad.h 49 SkDQuad subDivide(double t1, double t2) const;
50 static SkDQuad SubDivide(const SkPoint a[3], double t1, double t2) {
53 return quad.subDivide(t1, t2);
55 SkDPoint subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const;
56 static SkDPoint SubDivide(const SkPoint pts[3], const SkDPoint& a, const SkDPoint& c,
60 return quad.subDivide(a, c, t1, t2);
SkPathOpsLine.h 23 static SkDLine SubDivide(const SkPoint a[2], double t1, double t2) {
26 return line.subDivide(t1, t2);
39 SkDLine subDivide(double t1, double t2) const;
SkDQuadIntersection.cpp 121 SkIntersections* i, bool* subDivide) {
133 if (subDivide) {
134 *subDivide = true;
150 double t2s, double t2e, SkIntersections* i, bool* subDivide) {
151 SkDQuad hull = q1.subDivide(t1s, t1e);
211 if (add_intercept(q1, q2, tMin, tMax, i, subDivide)) {
215 return is_linear_inner(q2, tMin, tMax, q1, t1s, t1e, i, subDivide);
219 if (add_intercept(q1, q2, tMin, tsFound[split - 1], i, subDivide)) {
223 result = is_linear_inner(q2, tMin, tsFound[split - 1], q1, t1s, t1e, i, subDivide);
225 if (add_intercept(q1, q2, tsFound[split], tMax, i, subDivide)) {
    [all...]
SkPathOpsCurve.h 133 SkDQuad dst = quad.subDivide(startT, endT);
140 SkDCubic dst = cubic.subDivide(startT, endT);
SkDCubicToQuads.cpp 65 sub = cubic.subDivide(start, 1);
176 SkDCubic part = subDivide(0, inflectT[0]);
180 part = subDivide(inflectT[idx], inflectT[idx + 1]);
183 part = subDivide(inflectT[last], 1);
SkPathOpsQuad.cpp 51 SkDQuad sub = subDivide(startT, endT);
218 SkDQuad SkDQuad::subDivide(double t1, double t2) const {
240 SkDPoint SkDQuad::subDivide(const SkDPoint& a, const SkDPoint& c, double t1, double t2) const {
250 SkDQuad sub = subDivide(t1, t2);
  /external/skia/tests/
PathOpsDLineTest.cpp 46 line2 = line.subDivide(1, 0);
48 line2 = SkDLine::SubDivide(pts, 1, 0);
PathOpsQuadParameterizationTest.cpp 35 SkDQuad midThird = test.subDivide(1.0/3, 2.0/3);
PathOpsTestCommon.cpp 25 SkDCubic part = cubic.subDivide(tStart, tEnd);
  /external/chromium_org/third_party/skia/src/utils/
SkCubicInterval.cpp 27 // subdivide the range and try again
  /external/skia/src/utils/
SkCubicInterval.cpp 27 // subdivide the range and try again
  /external/chromium_org/third_party/skia/src/core/
SkStroke.cpp 115 int subDivide);
119 int subDivide);
249 int subDivide) {
259 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) {
264 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide);
265 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide);
285 int subDivide) {
316 if (--subDivide < 0) {
323 // subdivide if we can
324 if (--subDivide < 0)
    [all...]
  /external/skia/src/core/
SkStroke.cpp 115 int subDivide);
119 int subDivide);
249 int subDivide) {
259 if (--subDivide >= 0 && normals_too_curvy(unitNormalAB, *unitNormalBC)) {
264 this->quad_to(&tmp[0], normalAB, unitNormalAB, &norm, &unit, subDivide);
265 this->quad_to(&tmp[2], norm, unit, normalBC, unitNormalBC, subDivide);
285 int subDivide) {
316 if (--subDivide < 0) {
323 // subdivide if we can
324 if (--subDivide < 0)
    [all...]
  /external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
Octnode.java 112 public void subdivide(int depth, int minTrisPerNode){ method in class:Octnode
114 // no need to subdivide anymore
164 children[i].subdivide(depth + 1, minTrisPerNode);
169 public void subdivide(int minTrisPerNode){ method in class:Octnode
170 subdivide(0, minTrisPerNode);
  /external/chromium_org/content/browser/
browsing_instance.h 30 // We further subdivide a BrowsingInstance into SiteInstances, which represent
  /external/chromium_org/third_party/skia/src/gpu/
GrPathUtils.cpp 50 // Each time we subdivide, d should be cut in 4. So we need to
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
474 bool subdivide = false; local
492 // We need to subdivide if d0 + d1 > tolerance but we have the sqd values. We know
497 subdivide = 2 * d0d1 + d0Sqd + d1Sqd > toleranceSqd;
500 if (!subdivide) {
  /external/skia/src/gpu/
GrPathUtils.cpp 50 // Each time we subdivide, d should be cut in 4. So we need to
51 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
474 bool subdivide = false; local
492 // We need to subdivide if d0 + d1 > tolerance but we have the sqd values. We know
497 subdivide = 2 * d0d1 + d0Sqd + d1Sqd > toleranceSqd;
500 if (!subdivide) {

Completed in 443 milliseconds

1 2 3