Lines Matching defs:matrix
25 // If the bottom row of the matrix is [0, 0, not_one], we will treat the matrix as if it
185 // helper function to determine if upper-left 2x2 of matrix is degenerate
195 // if identity or translate matrix
344 // a full concat and/or just computing the matrix type is more expensive.
704 precision may be most important (here and matrix concat). Hence to avoid
745 // Since the determinant is on the order of the cube of the matrix members,
1476 // ignore the translation part of the matrix, just look at 2x2 portion.
1706 // A square matrix M can be decomposed (via polar decomposition) into two matrices --
1707 // an orthogonal matrix Q and a symmetric matrix S. In turn we can decompose S into U*W*U^T,
1708 // where U is another orthogonal matrix and W is a scale matrix. These can be recombined
1709 // to give M = (Q*U)*W*U^T, i.e., the product of two orthogonal matrices and a scale matrix.
1713 bool SkDecomposeUpper2x2(const SkMatrix& matrix,
1718 SkScalar A = matrix[SkMatrix::kMScaleX];
1719 SkScalar B = matrix[SkMatrix::kMSkewX];
1720 SkScalar C = matrix[SkMatrix::kMSkewY];
1721 SkScalar D = matrix[SkMatrix::kMScaleY];