Home
last modified time | relevance | path

Searched refs:tan0 (Results 1 - 3 of 3) sorted by relevance

/third_party/skia/src/core/
H A DSkGeometry.cpp213 // Tangents point in the direction of increasing T, so tan0 and -tan1 both point toward the in SkFindQuadMidTangent()
214 // midtangent. The bisector of tan0 and -tan1 is orthogonal to the midtangent: in SkFindQuadMidTangent()
218 SkVector tan0 = src[1] - src[0]; in SkFindQuadMidTangent() local
220 SkVector bisector = SkFindBisector(tan0, -tan1); in SkFindQuadMidTangent()
227 // = |2*T 1| * |tan1 - tan0| * |nx| in SkFindQuadMidTangent()
228 // |2*tan0 | |ny| in SkFindQuadMidTangent()
230 // = 2*T * ((tan1 - tan0) dot bisector) + (2*tan0 dot bisector) in SkFindQuadMidTangent()
232 // T = (tan0 dot bisector) / ((tan0 in SkFindQuadMidTangent()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrPathUtils.cpp613 // parallel to tan0.) in findCubicConvex180Chops()
615 // Tangent_Direction(T) x tan0 == 0 in findCubicConvex180Chops()
616 // (AT^2 x tan0) + (2BT x tan0) + (C x tan0) == 0 in findCubicConvex180Chops()
617 // (A x C)T^2 + (2B x C)T + (C x C) == 0 [[because tan0 == P1 - P0 == C]] in findCubicConvex180Chops()
621 // NOTE: if C == 0, then C != tan0. But this is fine because the curve is definitely in findCubicConvex180Chops()
649 // tan0. This will find any cusp point. in findCubicConvex180Chops()
651 // dot(tan0, Tangent_Direction(T)) == 0 in findCubicConvex180Chops()
654 // tan0 * | in findCubicConvex180Chops()
657 float2 tan0 = skvx::if_then_else(C != 0, C, p2 - p0); findCubicConvex180Chops() local
[all...]
/third_party/skia/src/gpu/tessellate/
H A DStrokeHardwareTessellator.cpp539 SkVector tan0 = junctionPoint - fLastControlPoint; in internalJoinTo() local
541 float rotation = SkMeasureAngleBetweenVectors(tan0, tan1); in internalJoinTo()
553 SkPoint bisector = SkFindBisector(tan0, tan1); in internalJoinTo()

Completed in 5 milliseconds