Affine transformation

Let be an affine space over a field , and be its associated vector space. An affine transformation is a bijection from onto itself that is an affine map; this means that a linear map from to is well defined by the equation g(y-x) =f(y)-f(x); here, as usual, the subtraction of two points denotes the free vector from the second point to the first one, and "well-defined" means that y-x= y'-x' implies that f(y)-f(x)=f(y')-f(x'). If the dimension of is at least two, a semiaffine transformation of is a bijection from onto itself satisfying: • For every -dimensional affine subspace of , then is also a -dimensional affine subspace of . • If and are parallel affine subspaces of , then and are parallel. These two conditions are satisfied by affine transformations, and express what is precisely meant by the expression that " preserves parallelism". These conditions are not independent as the second follows from the first. Furthermore, if the field has at least three elements, the first condition can be simplified to: is a collineation, that is, it maps lines to lines. ==Structure==

By the definition of an affine space, acts on , so that, for every pair (x, \mathbf{v}) in there is associated a point in . We can denote this action by \vec{v}(x) = y. Here we use the convention that \vec{v} = \textbf{v} are two interchangeable notations for an element of . By fixing a point in one can define a function by . For any , this function is one-to-one, and so, has an inverse function given by m_c^{-1}(\textbf{v})=\vec{v}(c). These functions can be used to turn into a vector space (with respect to the point ) by defining: :* x + y = m_c^{-1}\left(m_c(x) + m_c(y)\right),\text{ for all } x,y \text{ in } X, and :* rx = m_c^{-1}\left(r m_c(x)\right), \text{ for all } r \text{ in } k \text{ and } x \text{ in } X. This vector space has origin and formally needs to be distinguished from the affine space , but common practice is to denote it by the same symbol and mention that it is a vector space after an origin has been specified. This identification permits points to be viewed as vectors and vice versa. For any linear transformation of , we can define the function by L(c, \lambda)(x) = m_c^{-1}\left(\lambda (m_c (x))\right) = c + \lambda (\vec{cx}). Then is an affine transformation of which leaves the point fixed. It is a linear transformation of , viewed as a vector space with origin . Let be any affine transformation of . Pick a point in and consider the translation of by the vector \bold{w} = \overrightarrow{c \sigma (c)}, denoted by . Translations are affine transformations and the composition of affine transformations is an affine transformation. For this choice of , there exists a unique linear transformation of such that \sigma (x) = T_{\bold{w}} \left( L(c, \lambda)(x) \right). That is, an arbitrary affine transformation of is the composition of a linear transformation of (viewed as a vector space) and a translation of . This representation of affine transformations is often taken as the definition of an affine transformation (with the choice of origin being implicit). ==Representation==

As shown above, an affine map is the composition of two functions: a translation and a linear map. Ordinary vector algebra uses matrix multiplication to represent linear maps, and vector addition to represent translations. Formally, in the finite-dimensional case, if the linear map is represented as a multiplication by an invertible matrix A and the translation as the addition of a vector \mathbf{b}, an affine map f acting on a vector \mathbf{x} can be represented as \mathbf{y} = f(\mathbf{x}) = A \mathbf{x} + \mathbf{b}. Augmented matrix Using an augmented matrix and an augmented vector, it is possible to represent both the translation and the linear map using a single matrix multiplication. The technique requires that all vectors be augmented with a "1" at the end, and all matrices be augmented with an extra row of zeros at the bottom, an extra column—the translation vector—to the right, and a "1" in the lower right corner. If A is a matrix, \begin{bmatrix} \mathbf{y} \\ 1 \end{bmatrix} = \left[ \begin{array}{ccc|c} & A & & \mathbf{b} \\ 0 & \cdots & 0 & 1 \end{array} \right] \begin{bmatrix} \mathbf{x} \\ 1 \end{bmatrix} is equivalent to the following \mathbf{y} = A \mathbf{x} + \mathbf{b}. The above-mentioned augmented matrix is called an affine transformation matrix. In the general case, when the last row vector is not restricted to be \left[ \begin{array}{ccc|c} 0 & \cdots & 0 & 1 \end{array} \right], the matrix becomes a projective transformation matrix (as it can also be used to perform projective transformations). This representation exhibits the set of all invertible affine transformations as the semidirect product of K^n and \operatorname{GL}(n, K). This is a group under the operation of composition of functions, called the affine group. Ordinary matrix-vector multiplication always maps the origin to the origin, and could therefore never represent a translation, in which the origin must necessarily be mapped to some other point. By appending the additional coordinate "1" to every vector, one essentially considers the space to be mapped as a subset of a space with an additional dimension. In that space, the original space occupies the subset in which the additional coordinate is 1. Thus the origin of the original space can be found at (0,0, \dotsc, 0, 1). A translation within the original space by means of a linear transformation of the higher-dimensional space is then possible (specifically, a shear transformation). The coordinates in the higher-dimensional space are an example of homogeneous coordinates. If the original space is Euclidean, the higher dimensional space is a real projective space. The advantage of using homogeneous coordinates is that one can combine any number of affine transformations into one by multiplying the respective matrices. This property is used extensively in computer graphics, computer vision and robotics. Example augmented matrix Suppose you have three points that define a non-degenerate triangle in a plane, or four points that define a non-degenerate tetrahedron in 3-dimensional space, or generally points , ..., that define a non-degenerate simplex in -dimensional space. Suppose you have corresponding destination points , ..., , where these new points can lie in a space with any number of dimensions. (Furthermore, the new points need not form a non-degenerate simplex, nor even be distinct from each other.) The unique augmented matrix that achieves the affine transformation \begin{bmatrix}\mathbf{y}_i\\1\end{bmatrix} = M \begin{bmatrix}\mathbf{x}_i\\1\end{bmatrix} for every is M = \begin{bmatrix}\mathbf{y}_1&\cdots&\mathbf{y}_{n+1}\\1&\cdots&1\end{bmatrix} \begin{bmatrix}\mathbf{x}_1&\cdots&\mathbf{x}_{n+1}\\1&\cdots&1\end{bmatrix}^{-1}, using matrix inversion. ==Properties==

of squeeze mappings preserves areas, here illustrated with hyperbolic sectors. Properties preserved An affine transformation preserves: • collinearity between points: three or more points which lie on the same line (called collinear points) continue to be collinear after the transformation. • parallelism: two or more lines which are parallel, continue to be parallel after the transformation. • convexity of sets: a convex set continues to be convex after the transformation. Moreover, the extreme points of the original set are mapped to the extreme points of the transformed set. • ratios of lengths of parallel line segments: for distinct parallel segments defined by points p_1, p_2 and p_3, p_4, respectively, the ratio of \overrightarrow{p_1p_2} to \overrightarrow{p_3p_4} is the same as that of \overrightarrow{f(p_1)f(p_2)} to \overrightarrow{f(p_3)f(p_4)}. • barycenters of weighted collections of points. Groups As an affine transformation is invertible, the square matrix A appearing in its matrix representation is invertible. The matrix representation of the inverse transformation is thus \left[ \begin{array}{ccc|c} & A^{-1} & & -A^{-1}\vec{b} \ \\ 0 & \ldots & 0 & 1 \end{array} \right]. The invertible affine transformations (of an affine space onto itself) form the affine group, which has the general linear group of degree n as subgroup and is itself a subgroup of the general linear group of degree n + 1. The similarity transformations form the subgroup where A is a scalar times an orthogonal matrix. For example, if the affine transformation acts on the plane and if the determinant of A is 1 or −1 then the transformation is an equiareal mapping. Such transformations form a subgroup called the equi-affine group. A transformation that is both equi-affine and a similarity is an isometry of the plane taken with Euclidean distance. Each of these groups has a subgroup of orientation-preserving or positive affine transformations: those where the determinant of A is positive. In the last case this is in 3D the group of rigid transformations (proper rotations and pure translations). If there is a fixed point, we can take that as the origin, and the affine transformation reduces to a linear transformation. This may make it easier to classify and understand the transformation. For example, describing a transformation as a rotation by a certain angle with respect to a certain axis may give a clearer idea of the overall behavior of the transformation than describing it as a combination of a translation and a rotation. However, this depends on application and context. ==Affine maps==

An affine map f\colon\mathcal{A} \to \mathcal{B} between two affine spaces is a map on the points that acts linearly on the vectors (that is, the vectors between points of the space). In symbols, f determines a linear transformation \varphi such that, for any pair of points P, Q \in \mathcal{A}: \overrightarrow{f(P)~f(Q)} = \varphi(\overrightarrow{PQ}) or f(Q)-f(P) = \varphi(Q-P). We can interpret this definition in a few other ways, as follows. If an origin O \in \mathcal{A} is chosen, and B denotes its image f(O) \in \mathcal{B}, then this means that for any vector \vec{x}: f\colon (O+\vec{x}) \mapsto (B+\varphi(\vec{x})). If an origin O' \in \mathcal{B} is also chosen, this can be decomposed as an affine transformation g\colon \mathcal{A} \to \mathcal{B} that sends O \mapsto O', namely g\colon (O+\vec{x}) \mapsto (O'+\varphi(\vec{x})), followed by the translation by a vector \vec{b} = \overrightarrow{O'B}. The conclusion is that, intuitively, f consists of a translation and a linear map. Alternative definition Given two affine spaces \mathcal{A} and \mathcal{B}, over the same field, a function f\colon \mathcal{A} \to \mathcal{B} is an affine map if and only if for every family \{(P_i, \lambda_i)\}_{i\in I} of weighted points in \mathcal{A} such that \sum_{i\in I}\lambda_i = 1, we have f\left(\sum_{i\in I}\lambda_i P_i\right)=\sum_{i\in I}\lambda_i f(P_i). In other words, f preserves barycenters. Example Let \mathcal{A} be the three-dimensional Euclidean space, \mathcal{B} \subseteq \mathcal{A} a plane, and both be equipped with a Cartesian coordinate system. If f\colon\, \mathcal{A} \to \mathcal{B} is a parallel projection or, more generally, is generated by an axonometry, then f is affine and surjective. Hence it can be represented by \begin{bmatrix}x\\y\\z\end{bmatrix} \longmapsto \begin{bmatrix}x'\\y'\end{bmatrix} = A \begin{bmatrix}x\\y\\z\end{bmatrix} +\, b with a matrix A \in \R^{2\times 3} of rank 2 and a column vector b \in \R^2. In case b = (0,0)^\mathsf{T}, this is treated in more detail in the section Coordinate calculation at Axonometry. ==History==

The word "affine" as a mathematical term is defined in connection with tangents to curves in Euler's 1748 Introductio in analysin infinitorum. Felix Klein attributes the term "affine transformation" to Möbius and Gauss. == Image transformation ==

In their applications to digital image processing, the affine transformations are analogous to printing on a sheet of rubber and stretching the sheet's edges parallel to the plane. This transform relocates pixels requiring intensity interpolation to approximate the value of moved pixels, bicubic interpolation is the standard for image transformations in image processing applications. Affine transformations scale, rotate, translate, mirror and shear images as shown in the following examples: The affine transforms are applicable to the registration process where two or more images are aligned (registered). An example of image registration is the generation of panoramic images that are the product of multiple images stitched together. Affine warping The affine transform preserves parallel lines. However, the stretching and shearing transformations warp shapes, as the following example shows: This is an example of image warping. However, the affine transformations do not facilitate projection onto a curved surface or radial distortions. ==In the plane==

. The triangles ABZ, BCZ, and ACZ get mapped to ABZ, BCZ, and ACZ, respectively. Every affine transformations in a Euclidean plane is the composition of a translation and an affine transformation that fixes a point; the latter may be • a homothety, • rotations around the fixed point, • a scaling, with possibly negative scaling factors, in two directions (not necessarily perpendicular); this includes reflections, • a shear mapping • a squeeze mapping. Given two non-degenerate triangles ABC and A′B′C′ in a Euclidean plane, there is a unique affine transformation T that maps A to A′, B to B′ and C to C′. Each of ABC and A′B′C′ defines an affine coordinate system and a barycentric coordinate system. Given a point P, the point T(P) is the point that has the same coordinates on the second system as the coordinates of P on the first system. Affine transformations do not respect lengths or angles; they multiply areas by the constant factor :area of A′B′C′ / area of ABC. A given T may either be direct (respect orientation), or indirect (reverse orientation), and this may be determined by comparing the orientations of the triangles. ==Examples==

Over the real numbers The functions f\colon \R \to \R,\; f(x) = mx + c with m and c in \R and m\ne 0, are precisely the affine transformations of the real line. In plane geometry In \mathbb{R}^2, the transformation shown at left is accomplished using the map given by: \begin{bmatrix} x \\ y\end{bmatrix} \mapsto \begin{bmatrix} 0&1\\ 2&1 \end{bmatrix}\begin{bmatrix} x \\ y\end{bmatrix} + \begin{bmatrix} -100 \\ -100\end{bmatrix} Transforming the three corner points of the original triangle (in red) gives three new points which form the new triangle (in blue). This transformation skews and translates the original triangle. In fact, all triangles are related to one another by affine transformations. This is also true for all parallelograms, but not for all quadrilaterals. ==See also==