Lines Matching defs:depth
83 SkScalar depth,
124 SkScalar depth,
213 // depth. If we are in fill mode, the final ring will automatically be fanned.
342 SkScalar depth = -fNorms[edgeIdx].dot(v);
343 return depth;
668 static SkScalar compute_coverage(SkScalar depth, SkScalar initialDepth, SkScalar initialCoverage,
673 SkScalar result = (depth - initialDepth) / (targetDepth - initialDepth) *
687 // Loop through all the points in the ring and find the intersection with the smallest depth
719 SkScalar depth = this->computeDepthFromEdge(lastRing.origEdgeID(minEdgeIdx), newPt);
720 if (depth >= targetDepth) {
721 // None of the bisectors intersect before reaching the desired depth.
722 // Just step them all to the desired depth
723 depth = targetDepth;
736 depth, &newPt)) {
749 depth, &newPt)) {
767 depth, &newPt)) {
803 SkScalar coverage = compute_coverage(depth, initialDepth, initialCoverage,
805 newIdx = this->addPt(fCandidateVerts.point(i), depth, coverage,
809 this->updatePt(fCandidateVerts.originatingIdx(i), fCandidateVerts.point(i), depth,
1109 this->point(i), 0.5f + (this->depth(i)/(2 * kAntialiasingRadius)),
1114 if (this->depth(i) <= -kAntialiasingRadius) {