HomeSort by relevance Sort by last modified time
    Searched refs:subdivide (Results 1 - 4 of 4) sorted by null

  /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);
Octree.java 122 root.subdivide(minTrisPerNode);
  /external/webkit/Source/WebCore/platform/graphics/gpu/
LoopBlinnPathProcessor.cpp 205 Segment* subdivide(float param) function in class:WebCore::LoopBlinnPathProcessorImplementation::Segment
235 Segment* subdivide() { return subdivide(0.5f); } function in class:WebCore::LoopBlinnPathProcessorImplementation::Segment
398 Segment* subdivide(Segment* segment, float param) function in class:WebCore::LoopBlinnPathProcessorImplementation::Contour
400 Segment* left = segment->subdivide(param);
409 Segment* subdivide(Segment* segment) function in class:WebCore::LoopBlinnPathProcessorImplementation::Contour
411 Segment* left = segment->subdivide();
545 // curves and subdivide curves appropriately.
553 // Classify curves, compute texture coordinates and subdivide as
576 cur->subdivide(seg)
    [all...]
  /external/skia/src/gpu/
GrPathUtils.cpp 51 // Each time we subdivide, d should be cut in 4. So we need to
52 // subdivide x = log4(d/tol) times. x subdivisions creates 2^(x)
411 bool subdivide = false; local
429 // We need to subdivide if d0 + d1 > tolerance but we have the sqd values. We know
434 subdivide = 2 * d0d1 + d0Sqd + d1Sqd > toleranceSqd;
437 if (!subdivide) {

Completed in 696 milliseconds