Searched refs:subdivide (Results 1 - 5 of 5) sorted by relevance

/external/skia/samplecode/
H A DSampleCull.cpp30 static void subdivide(SkPath* path, SkScalar bump) { function
122 subdivide(&fPath, bump);
123 subdivide(&fPath, bump);
124 subdivide(&fPath, bump);
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
H A DOctnode.java112 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);
H A DOctree.java122 root.subdivide(minTrisPerNode);
/external/skia/src/gpu/
H A DGrPathUtils.cpp49 // Each time we subdivide, d should be cut in 4. So we need to
50 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
495 bool subdivide = false; local
513 // We need to subdivide if d0 + d1 > tolerance but we have the sqd values. We know
518 subdivide = 2 * d0d1 + d0Sqd + d1Sqd > toleranceSqd;
521 if (!subdivide) {
/external/skia/src/core/
H A DSkGeometry.cpp1396 static SkPoint* subdivide(const SkConic& src, SkPoint pts[], int level) {
1406 pts = subdivide(dst[0], pts, level);
1407 return subdivide(dst[1], pts, level);
1414 SkDEBUGCODE(SkPoint* endPts =) subdivide(*this, pts + 1, pow2);

Completed in 143 milliseconds