Lines Matching defs:affine
78 * - #Affine: the transformation is stored as a (Dim+1)^2 matrix,
93 * Therefore, an affine transformation matrix M is shaped like this:
134 * \b Affine \b Matrix A (Dim)x(Dim+1):
156 * transformation of non homogeneous vectors by an affine transformation. In
202 /** type of read/write reference to the affine part of the transformation */
206 /** type of read reference to the affine part of the transformation */
220 enum { TransformTimeDiagonalMode = ((Mode==int(Isometry))?Affine:int(Mode)) };
231 * If Mode==Affine, then the last row is set to [0 ... 0 1] */
235 internal::transform_make_affine<(int(Mode)==Affine) ? Affine : AffineCompact>::run(m_matrix);
301 // Affine | AffineCompact | Isometry = Projective
306 // Isometry = Affine | AffineCompact
307 EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(OtherMode==int(Affine)||OtherMode==int(AffineCompact), Mode!=int(Isometry)),
331 // So the only possibility is that OtherMode == Affine
377 /** \returns a read-only expression of the Dim x HDim affine part of the transformation */
378 inline ConstAffinePart affine() const { return take_affine_part::run(m_matrix); }
379 /** \returns a writable expression of the Dim x HDim affine part of the transformation */
380 inline AffinePart affine() { return take_affine_part::run(m_matrix); }
395 * \li an affine transformation matrix of size Dim x Dim+1,
408 * \li an affine transformation matrix of size Dim x Dim+1,
418 * The rhs diagonal matrix is interpreted as an affine scaling transformation. The
433 * The lhs diagonal matrix is interpreted as an affine scaling transformation. The
534 inline Transform<Scalar,Dim,(int(Mode)==int(Isometry)?int(Affine):int(Mode))> operator*(const UniformScaling<Scalar>& s) const
536 Transform<Scalar,Dim,(int(Mode)==int(Isometry)?int(Affine):int(Mode)),Options> res = *this;
599 * \returns the Dim x Dim linear part if the transformation is affine,
605 * \returns the Dim x Dim linear part if the transformation is affine,
612 * \returns the translation part if the transformation is affine,
618 * \returns the translation part if the transformation is affine,
649 typedef Transform<float,2,Affine> Affine2f;
651 typedef Transform<float,3,Affine> Affine3f;
653 typedef Transform<double,2,Affine> Affine2d;
655 typedef Transform<double,3,Affine> Affine3d;
707 * \warning this conversion might loss data if \c *this is not affine
853 affine() += other * m_matrix.row(Dim);
1124 * - #Projective if the transformation is not necessarily affine, i.e., if the
1126 * - #Affine if the last row can be assumed to be [0 ... 0 1]
1152 else if(hint&Affine)
1171 *** Specializations of take affine part ***
1211 transform->affine() = other;
1241 (LhsMode == (int)Affine || RhsMode == (int)Affine ) ? Affine :
1277 TopLeftLhs(res, 0, 0, Dim, other.cols()).noalias() = T.affine() * other;
1339 // affine matrix * T
1349 res.affine().noalias() = other * tr.matrix();
1355 // affine matrix * AffineCompact
