Lines Matching full:bisector
159 fBisectors[cur].negate(); // make the bisector face in
314 // along the 'bisector' from the 'startIdx'-th point.
316 const SkVector& bisector,
322 // First find the point where the edge and the bisector intersect
325 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm);
331 newP = bisector;
338 // Then offset along the bisector from that point the correct distance
339 SkScalar dot = bisector.dot(norm);
341 *result = bisector;
552 SkPoint miter = previousRing.bisector(cur);
571 // The bisector outset point
572 SkPoint miter = previousRing.bisector(cur);
669 bool result = intersect(this->point(lastRing.index(cur)), lastRing.bisector(cur),
670 this->point(lastRing.index(next)), lastRing.bisector(next),
675 SkScalar dist = -t * lastRing.norm(cur).dot(lastRing.bisector(cur));
687 SkPoint newPt = lastRing.bisector(minEdgeIdx);
706 lastRing.bisector(0),
719 lastRing.bisector(cur),
737 lastRing.bisector(cur),
858 fPts[cur].fBisector.negate(); // make the bisector face in
