bisector (reference) in projects: third_party - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

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

/third_party/skia/src/gpu/geometry/
H A D	GrAAConvexTessellator.cpp	192 fBisectors[cur].negate(); // make the bisector face in in computeBisectors() 347 // along the 'bisector' from the 'startIdx'-th point. 349 const SkVector& bisector, 355 // First find the point where the edge and the bisector intersect 358 SkScalar t = perp_intersect(fPts[startIdx], bisector, fPts[edgeIdx], norm); 364 newP = bisector; 371 // Then offset along the bisector from that point the correct distance 372 SkScalar dot = bisector.dot(norm); 374 *result = bisector; 572 SkPoint miter = previousRing.bisector(cu [all...]
H A D	GrAATriangulator.cpp	96 Edge bisector(v, v->fPartner, 1, EdgeType::kConnector); in makeEvent() 99 if (line.intersect(bisector.fLine, &p) && !c.sweep_lt(p, top->fPoint) && in makeEvent() 447 Line bisector(innerPoint, outerPoint); in strokeBoundary() 448 Line tangent(v->fPoint, v->fPoint + SkPoint::Make(bisector.fA, bisector.fB)); in strokeBoundary() 462 !outerTangent.intersect(bisector, &outerPoint)) { in strokeBoundary() 470 bisector.intersect(prevTangent, &outerPoint); in strokeBoundary() 473 bisector.intersect(nextTangent, &outerPoint); in strokeBoundary() 487 bisector.intersect(prevTangent, &innerPoint); in strokeBoundary() 490 bisector in strokeBoundary() [all...]
H A D	GrAAConvexTessellator.h	`154 const SkPoint& bisector(int index) const { return fPts[index].fBisector; } in bisector() function in GrAAConvexTessellator::Ring 193 // Movable points are those that can be slid along their bisector. 212 bool computePtAlongBisector(int startIdx, const SkPoint& bisector, 254 // movable points are those that can be slid further along their bisector 262 // The inward facing bisector at each point in the original polygon. Only`
/third_party/skia/src/gpu/tessellate/
H A D	StrokeHardwareTessellator.cpp	`552 // Find the bisector so we can split the join in half. in internalJoinTo() 553 SkPoint bisector = SkFindBisector(tan0, tan1); in internalJoinTo() local 563 bisector = (junctionPoint + bisector) - (junctionPoint - bisector); in internalJoinTo() 564 c0 = junctionPoint + bisector; in internalJoinTo() 565 c1 = junctionPoint - bisector; in internalJoinTo()`
/third_party/skia/src/core/
H A D	SkGeometry.cpp	191 // a,b are >90 degrees apart. Find the bisector of their interior normals instead. (Above 90 in SkFindBisector() 197 // a,b are <-90 degrees apart. Find the bisector of their interior normals instead. (Below in SkFindBisector() 214 // midtangent. The bisector of tan0 and -tan1 is orthogonal to the midtangent: in SkFindQuadMidTangent() 220 SkVector bisector = SkFindBisector(tan0, -tan1); in SkFindQuadMidTangent() local 222 // The midtangent can be found where (F' dot bisector) = 0: in SkFindQuadMidTangent() 224 // 0 = (F'(T) dot bisector) = \|2T 1\| \|p0 - 2p1 + p2\| \|bisector.x\| in SkFindQuadMidTangent() 225 // \|-2p0 + 2p1 \| \|bisector.y\| in SkFindQuadMidTangent() 230 // = 2T ((tan1 - tan0) dot bisector) + (2*tan0 dot bisector) in SkFindQuadMidTangent() [all...]

Completed in 6 milliseconds