DOCSLIB.ORG

The Affine Group of Transformations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Affine Group of Transformations The Affine Group of Transformations Kenneth H. Carpenter Department of Electrical and Computer Engineering Kansas State University February 26, 1997 (revised September 20, 2001) 1 Introduction The affine group is a set of transformations in space that leave straight lines as straight lines. (These can be thought of as transformations of the coordinate system, leaving the objects unchanged, or as transformations of the objects, leaving the coordinate system unchanged. We shall take the latter viewpoint, since it is the one most closely associated with computer graphics.) Since one such transformation followed by another results in straight lines going to straight lines going to straight lines, the result of two affine transformations in succession is a third affine transformation. Further, one can reverse any such transformation, to get back to the original lines, so each affine transformation has an inverse transformation. This is all that is required to form a group in mathematics: • set of objects: the transformations themselves • equivalence relation: two transformations are equivalent if they each transform any specific line into the same new line • operation: performing first one transformation then another yields a third • satisfies the group postulates: If a, b, c,... are group members and is the operation, then 1. Closure: a b = c (result of operation is in the set - true for affine transformations) 2. Identity: There is an element i such that a i = a for all a (the identity transformation is to do nothing!) 3. Inverses: For every a there must be a b such that a b = i (true for affine transformations - just reverse what was done) 4. Associativity: a (b c) = (a b) c (This is not as obvious, but will be shown later to be true for affine transformations.) Since affine transformations form a group, group theory shows that there exist matrix representations for the group – that is, there is a group of matrices that follows the same rules as the group, with the matrices being the group members, and the operation being matrix multiplication. We will find and use one or more of these representations. 2 The analytic geometry of affine transformations Let the usual notation of x, y, z for the rectangular coordinates of points in three-dimensional space be replaced by x1, x2, x3. Then we can refer to a general coordinate as xi where i = 1, 2, or 3. (Note that x3 does not mean x cubed any more! When we want powers of the xi we have to use parentheses like this: (x2)3.) 1 Affine Transformations - K. H. Carpenter - 20SEP01 2 A general transformation of the points of an object replaces the xi representing a point in space with a new set yi related to the original by three functions of three variables: yi = f i(x j). (1) We now inquire what restrictions must be placed on these functions for the transformations to be affine. But first we must find a way to represent a straight line. 2.1 Straight lines in parametric form The simplest way to represent a curve in multiple dimensions is by a set of parametric equations, one for each dimension: xi = gi(t), (2) where t is the parameter. Now we can take the differential of eq.(2) to obtain dxi = (dgi/dt)dt. For the curve to be a straight line the ratios dxi/dx j must be the same for all t. This will be true if each dgi/dt is a constant for all t. Hence one way we can express the parametric functions of any straight line is xi = gi(t) = αit + βi. (3) 2.2 Affine transformations in terms of parametric straight lines Since the result of affine transforming a straight line must be another straight line, and since any straight line can be written in the form of eq.(3), the functions of the transformation must yield f i(α jt + β j) = γit + δi. (4) Since d f i/dt = γi, f i can contain only first powers of t, and hence only first powers of the x j. We can thus write i i j X i j i X i j j i y = f (x ) = (r j x ) + s = [r j(α t + β )] + s . (5) j j i i where the r j and the s are the constants that specify the transformation. i The r j values are not entirely arbitrary. Since the inverse transformation must exist (for the affine transfor- i mations to form a group), the matrix of the r j’s must have an inverse, hence its determinant must be non-zero. 2.3 Affine transformations retain parallel properties As a corollary to affine transformations being linear, parallel lines subject to the same transformation, remain parallel, and lines that are not parallel before transformation are not parallel after. Parallel lines in the parametric form of eq.(3) have the same αi values but different βi values. From eq.(5) and eq.(4) it can be seen that two parallel lines, after the same transformation, will have the same γi values but different δi values and hence be parallel. The proof of the converse is left as an exercise for the reader. Affine Transformations - K. H. Carpenter - 20SEP01 3 3 The group operation – successive transformations 3.1 From the viewpoint of analytic geometry The constants in eq.(5) represent rotations and translations along with possible scaling and reflection. These i i operations are illustrated in chapter 4 of the text by Angel[1]. Let ra j and sa represent the r and s constants for the a transformation; similarly define the constants for the b transformation. Then successive transformations yields a new transformation c where the constants of c are given by i X i k rc j = rbkra j (6) k i X i k i sc = ( rbk sa) + sb. (7) k This can be recognized as the component form of matrix multiplication between rotation matrices Rb and Ra along with translation vectors S a and S b. In general, the R matrix contains scale factors, inversions, and shears, as well as rotations. When a transfor- mation is a pure rotation, then S = 0 and the inverse of R is its transpose. When scaling occurs the determinant of R has a magnitude other than one, and when reflection occurs the determinant of R is negative. 3.2 From the viewpoint of a matrix representation of the group The two sets of constants that make up the R matrix and S vector for a transformation may be combined into a single square matrix T as R | S T = . (8) 0 | 1 The vector S is appended on the right to the matrix R and a fourth row is made up of “zeros” and a single “one” at the lower right. Now Tc = TbTa, and matrix multiplication is isomorphic to successive transformations, with the first transformation being on the right in the product. Since matrix multiplication is associative, we see that the requirement for associativity of the transforma- tions is met. 4 Homogeneous coordinates With the transformation matrix defined as the T of eq.(8), it is possible to express the change of coordinates on transformation by a single matrix multiplication, if the vector of coordinates is extended to be the four- dimensional X: wx1 wx2 X = , (9) wx3 w where w is any non-zero constant. An obvious choice is w = 1. With such a definition for X and a similar one for the vector Y that results from a transformation, we have Y = TX. Affine Transformations - K. H. Carpenter - 20SEP01 4 5 Primitive transformations Any transformation may be expressed by a product of simpler, primitive transformations. The choice of prim- itive transformations is somewhat arbitrary. In three dimensions, one can show that any rotation is the product of three rotations. Translations can always be separated from rotations. For more general situations, involv- ing scaling and shearing, the choice of primitives is not so simple. In the following it will be shown that any two-dimensional R can be replaced by a sequence of two-dimensional rotations and scalings. 5.1 Repeated transformations leave the R part a product of R parts From eq.(8), one sees the separation of a general transformation matrix into a translation part S and a general- ized rotation part R. If one multiplies together two such matrices, the R part of the product will be the product of the R parts of the two being multiplied. This continues for any number of transformations. The R parts affect the S parts applied earlier, but the S parts have no effect on the final R part. Thus any transformation could have all its primitives consist of R parts only, except for the last one applied. 5.2 Case of shear For a shear primitive, the transformation has a zero S part and a R part that is the identity matrix with one non- diagonal element replaced by a non-zero value. Since shear is inherently two-dimensional, let us consider only a two-by-two matrix of shear and how it may be broken into other two-by-two matrices representing rotations and scalings. The general form of a two-dimensional rotation matrix is " # cos θ − sin θ U(θ) = . (10) sin θ cos θ The general form of a shear along x is " # 1 h W = . (11) 0 1 The general form of a scaling is " # a 0 K = . (12) 0 b By multiplying out and forming four scalar equations, one can show that it is not possible to find θ1, θ2, a, and b such that W = U(θ1)KU(θ2).
Load more

Recommended publications
  • Affine Reflection Group Codes
    Affine Reflection Group Codes Terasan Niyomsataya1, Ali Miri1,2 and Monica Nevins2 School of Information Technology and Engineering (SITE)1 Department of Mathematics and Statistics2 University of Ottawa, Ottawa, Canada K1N 6N5 email: {tniyomsa,samiri}@site.uottawa.ca, [email protected] Abstract This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irreducible affine reflection groups of rank n ≥ 2, for varying stabilizer subgroups. Moreover, we use a detailed analysis of the geometry of affine reflection groups to produce an efficient decoding algorithm which is equivalent to the maximum-likelihood decoder. Its complexity depends only on the dimension of the vector space containing the codewords, and not on the number of codewords. We give several examples of the decoding algorithm, both to demonstrate its correctness and to show how, in small rank cases, it may be further streamlined by exploiting additional symmetries of the group. 1 1 Introduction Slepian [11] introduced group codes whose codewords represent a finite set of signals combining coding and modulation, for the Gaussian channel. A thorough survey of group codes can be found in [8]. The codewords lie on a sphere in n−dimensional Euclidean space Rn with equal nearest-neighbour distances. This gives congruent maximum-likelihood (ML) decoding regions, and hence equal error probability, for all codewords. Given a group G with a representation (action) on Rn, that is, an 1Keywords: Group codes, initial vector problem, decoding schemes, affine reflection groups 1 orthogonal n × n matrix Og for each g ∈ G, a group code generated from G is given by the set of all cg = Ogx0 (1) n for all g ∈ G where x0 = (x1, .
    [Show full text]
  • Efficient Learning of Simplices
    Efficient Learning of Simplices Joseph Anderson Navin Goyal Computer Science and Engineering Microsoft Research India Ohio State University [email protected] [email protected] Luis Rademacher Computer Science and Engineering Ohio State University [email protected] Abstract We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are polynomial in n. This answers a question of Frieze, Jerrum and Kannan [FJK96]. Our result can also be interpreted as efficiently learning the intersection of n + 1 half-spaces in Rn in the model where the intersection is bounded and we are given polynomially many uniform samples from it. Our proof uses the local search technique from Independent Component Analysis (ICA), also used by [FJK96]. Unlike these previous algorithms, which were based on analyzing the fourth moment, ours is based on the third moment. We also show a direct connection between the problem of learning a simplex and ICA: a simple randomized reduction to ICA from the problem of learning a simplex. The connection is based on a known representation of the uniform measure on a sim- plex. Similar representations lead to a reduction from the problem of learning an affine arXiv:1211.2227v3 [cs.LG] 6 Jun 2013 transformation of an n-dimensional ℓp ball to ICA. 1 Introduction We are given uniformly random samples from an unknown convex body in Rn, how many samples are needed to approximately reconstruct the body? It seems intuitively clear, at least for n = 2, 3, that if we are given sufficiently many such samples then we can reconstruct (or learn) the body with very little error.
    [Show full text]
  • Feature Matching and Heat Flow in Centro-Affine Geometry
    Symmetry, Integrability and Geometry: Methods and Applications SIGMA 16 (2020), 093, 22 pages Feature Matching and Heat Flow in Centro-Affine Geometry Peter J. OLVER y, Changzheng QU z and Yun YANG x y School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA E-mail: [email protected] URL: http://www.math.umn.edu/~olver/ z School of Mathematics and Statistics, Ningbo University, Ningbo 315211, P.R. China E-mail: [email protected] x Department of Mathematics, Northeastern University, Shenyang, 110819, P.R. China E-mail: [email protected] Received April 02, 2020, in final form September 14, 2020; Published online September 29, 2020 https://doi.org/10.3842/SIGMA.2020.093 Abstract. In this paper, we study the differential invariants and the invariant heat flow in centro-affine geometry, proving that the latter is equivalent to the inviscid Burgers' equa- tion. Furthermore, we apply the centro-affine invariants to develop an invariant algorithm to match features of objects appearing in images. We show that the resulting algorithm com- pares favorably with the widely applied scale-invariant feature transform (SIFT), speeded up robust features (SURF), and affine-SIFT (ASIFT) methods. Key words: centro-affine geometry; equivariant moving frames; heat flow; inviscid Burgers' equation; differential invariant; edge matching 2020 Mathematics Subject Classification: 53A15; 53A55 1 Introduction The main objective in this paper is to study differential invariants and invariant curve flows { in particular the heat flow { in centro-affine geometry. In addition, we will present some basic applications to feature matching in camera images of three-dimensional objects, comparing our method with other popular algorithms.
    [Show full text]
  • The Affine Group of a Lie Group
    THE AFFINE GROUP OF A LIE GROUP JOSEPH A. WOLF1 1. If G is a Lie group, then the group Aut(G) of all continuous auto- morphisms of G has a natural Lie group structure. This gives the semi- direct product A(G) = G-Aut(G) the structure of a Lie group. When G is a vector group R", A(G) is the ordinary affine group A(re). Follow- ing L. Auslander [l ] we will refer to A(G) as the affine group of G, and regard it as a transformation group on G by (g, a): h-^g-a(h) where g, hEG and aGAut(G) ; in the case of a vector group, this is the usual action on A(») on R". If B is a compact subgroup of A(n), then it is well known that B has a fixed point on R", i.e., that there is a point xGR" such that b(x)=x for every bEB. For A(ra) is contained in the general linear group GL(« + 1, R) in the usual fashion, and B (being compact) must be conjugate to a subgroup of the orthogonal group 0(w + l). This conjugation can be done leaving fixed the (« + 1, w + 1)-place matrix entries, and is thus possible by an element of k(n). This done, the translation-parts of elements of B must be zero, proving the assertion. L. Auslander [l] has extended this theorem to compact abelian subgroups of A(G) when G is connected, simply connected and nil- potent. We will give a further extension.
    [Show full text]
  • Paraperspective ≡ Affine
    International Journal of Computer Vision, 19(2): 169–180, 1996. Paraperspective ´ Affine Ronen Basri Dept. of Applied Math The Weizmann Institute of Science Rehovot 76100, Israel [email protected] Abstract It is shown that the set of all paraperspective images with arbitrary reference point and the set of all affine images of a 3-D object are identical. Consequently, all uncali- brated paraperspective images of an object can be constructed from a 3-D model of the object by applying an affine transformation to the model, and every affine image of the object represents some uncalibrated paraperspective image of the object. It follows that the paraperspective images of an object can be expressed as linear combinations of any two non-degenerate images of the object. When the image position of the reference point is given the parameters of the affine transformation (and, likewise, the coefficients of the linear combinations) satisfy two quadratic constraints. Conversely, when the values of parameters are given the image position of the reference point is determined by solving a bi-quadratic equation. Key words: affine transformations, calibration, linear combinations, paraperspective projec- tion, 3-D object recognition. 1 Introduction It is shown below that given an object O ½ R3, the set of all images of O obtained by applying a rigid transformation followed by a paraperspective projection with arbitrary reference point and the set of all images of O obtained by applying a 3-D affine transformation followed by an orthographic projection are identical. Consequently, all paraperspective images of an object can be constructed from a 3-D model of the object by applying an affine transformation to the model, and every affine image of the object represents some paraperspective image of the object.
    [Show full text]
  • The Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling
    The Hidden Subgroup Problem in Affine Groups: Basis Selection in Fourier Sampling Cristopher Moore1, Daniel Rockmore2, Alexander Russell3, and Leonard J. Schulman4 1 University of New Mexico, [email protected] 2 Dartmouth College, [email protected] 3 University of Connecticut, [email protected] 4 California Institute of Technology, [email protected] Abstract. Many quantum algorithms, including Shor's celebrated fac- toring and discrete log algorithms, proceed by reduction to a hidden subgroup problem, in which a subgroup H of a group G must be deter- mined from a quantum state uniformly supported on a left coset of H. These hidden subgroup problems are then solved by Fourier sam- pling: the quantum Fourier transform of is computed and measured. When the underlying group is non-Abelian, two important variants of the Fourier sampling paradigm have been identified: the weak standard method, where only representation names are measured, and the strong standard method, where full measurement occurs. It has remained open whether the strong standard method is indeed stronger, that is, whether there are hidden subgroups that can be reconstructed via the strong method but not by the weak, or any other known, method. In this article, we settle this question in the affirmative. We show that hidden subgroups of semidirect products of the form Zq n Zp, where q j (p − 1) and q = p=polylog(p), can be efficiently determined by the strong standard method. Furthermore, the weak standard method and the \forgetful" Abelian method are insufficient for these groups. We ex- tend this to an information-theoretic solution for the hidden subgroup problem over the groups Zq n Zp where q j (p − 1) and, in particular, the Affine groups Ap.
    [Show full text]
  • Lecture 16: Planar Homographies Robert Collins CSE486, Penn State Motivation: Points on Planar Surface
    Robert Collins CSE486, Penn State Lecture 16: Planar Homographies Robert Collins CSE486, Penn State Motivation: Points on Planar Surface y x Robert Collins CSE486, Penn State Review : Forward Projection World Camera Film Pixel Coords Coords Coords Coords U X x u M M V ext Y proj y Maff v W Z U X Mint u V Y v W Z U M u V m11 m12 m13 m14 v W m21 m22 m23 m24 m31 m31 m33 m34 Robert Collins CSE486, PennWorld State to Camera Transformation PC PW W Y X U R Z C V Rotate to Translate by - C align axes (align origins) PC = R ( PW - C ) = R PW + T Robert Collins CSE486, Penn State Perspective Matrix Equation X (Camera Coordinates) x = f Z Y X y = f x' f 0 0 0 Z Y y' = 0 f 0 0 Z z' 0 0 1 0 1 p = M int ⋅ PC Robert Collins CSE486, Penn State Film to Pixel Coords 2D affine transformation from film coords (x,y) to pixel coordinates (u,v): X u’ a11 a12xa'13 f 0 0 0 Y v’ a21 a22 ya'23 = 0 f 0 0 w’ Z 0 0z1' 0 0 1 0 1 Maff Mproj u = Mint PC = Maff Mproj PC Robert Collins CSE486, Penn StateProjection of Points on Planar Surface Perspective projection y Film coordinates x Point on plane Rotation + Translation Robert Collins CSE486, Penn State Projection of Planar Points Robert Collins CSE486, Penn StateProjection of Planar Points (cont) Homography H (planar projective transformation) Robert Collins CSE486, Penn StateProjection of Planar Points (cont) Homography H (planar projective transformation) Punchline: For planar surfaces, 3D to 2D perspective projection reduces to a 2D to 2D transformation.
    [Show full text]
  • Affine Dilatations
    2.6. AFFINE GROUPS 75 2.6 Affine Groups We now take a quick look at the bijective affine maps. GivenanaffinespaceE, the set of affine bijections f: E → E is clearly a group, called the affine group of E, and denoted by GA(E). Recall that the group of bijective linear maps of the vector −→ −→ −→ space E is denoted by GL( E ). Then, the map f → f −→ defines a group homomorphism L:GA(E) → GL( E ). The kernel of this map is the set of translations on E. The subset of all linear maps of the form λ id−→, where −→ E λ ∈ R −{0}, is a subgroup of GL( E ), and is denoted as R∗id−→. E 76 CHAPTER 2. BASICS OF AFFINE GEOMETRY The subgroup DIL(E)=L−1(R∗id−→)ofGA(E) is par- E ticularly interesting. It turns out that it is the disjoint union of the translations and of the dilatations of ratio λ =1. The elements of DIL(E) are called affine dilatations (or dilations). Given any point a ∈ E, and any scalar λ ∈ R,adilata- tion (or central dilatation, or magnification, or ho- mothety) of center a and ratio λ,isamapHa,λ defined such that Ha,λ(x)=a + λax, for every x ∈ E. Observe that Ha,λ(a)=a, and when λ = 0 and x = a, Ha,λ(x)isonthelinedefinedbya and x, and is obtained by “scaling” ax by λ.Whenλ =1,Ha,1 is the identity. 2.6. AFFINE GROUPS 77 −−→ Note that H = λ id−→.Whenλ = 0, it is clear that a,λ E Ha,λ is an affine bijection.
    [Show full text]
  • Affine Transformations and Rotations
    CMSC 425 Dave Mount & Roger Eastman CMSC 425: Lecture 6 Affine Transformations and Rotations Affine Transformations: So far we have been stepping through the basic elements of geometric programming. We have discussed points, vectors, and their operations, and coordinate frames and how to change the representation of points and vectors from one frame to another. Our next topic involves how to map points from one place to another. Suppose you want to draw an animation of a spinning ball. How would you define the function that maps each point on the ball to its position rotated through some given angle? We will consider a limited, but interesting class of transformations, called affine transfor- mations. These include (among others) the following transformations of space: translations, rotations, uniform and nonuniform scalings (stretching the axes by some constant scale fac- tor), reflections (flipping objects about a line) and shearings (which deform squares into parallelograms). They are illustrated in Fig. 1. rotation translation uniform nonuniform reflection shearing scaling scaling Fig. 1: Examples of affine transformations. These transformations all have a number of things in common. For example, they all map lines to lines. Note that some (translation, rotation, reflection) preserve the lengths of line segments and the angles between segments. These are called rigid transformations. Others (like uniform scaling) preserve angles but not lengths. Still others (like nonuniform scaling and shearing) do not preserve angles or lengths. Formal Definition: Formally, an affine transformation is a mapping from one affine space to another (which may be, and in fact usually is, the same space) that preserves affine combi- nations.
    [Show full text]
  • Determinants and Transformations 1. (A.) 2
    Lecture 3 answers to exercises: Determinants and transformations 1. (a:) 2 · 4 − 3 · (−1) = 11 (b:) − 5 · 2 − 1 · 0 = −10 (c:) Of this matrix we cannot compute the determinant because it is not square. (d:) −5·7·1+1·(−2)·3+(−1)·1·0−(−1)·7·3−1·1·1−(−5)·(−2)·0 = −35−6+21−1 = −21 2. 2 5 −2 4 2 −2 6 4 −1 3 6 −1 1 2 3 −83 3 −1 1 3 42 1 x = = = 20 y = = = −10 4 5 −2 −4 4 4 5 −2 −4 2 3 4 −1 3 4 −1 −1 2 3 −1 2 3 4 5 2 3 4 6 −1 2 1 −57 1 z = = = 14 4 5 −2 −4 4 3 4 −1 −1 2 3 3. Yes. Just think of a matrix and apply it to the zero vector. The outcome of all components are zeros. 4. We find the desired matrix by multiplying the two matrices for the two parts. The 0 −1 matrix for reflection in x + y = 0 is , and the matrix for rotation of 45◦ about −1 0 p p 1 2 − 1 2 2 p 2p the origin is 1 1 . So we compute (note the order!): 2 2 2 2 p p p p 1 2 − 1 2 0 −1 1 2 − 1 2 2 p 2p 2 p 2 p 1 1 = 1 1 2 2 2 2 −1 0 − 2 2 − 2 2 5. A must be the zero matrix. This is true because the vectors 2 3 2, 1 0 2, and 0 2 4 are linearly independent.
    [Show full text]
  • Homographic Wavelet Analysis in Identification of Characteristic Image Features
    Optica Applicata, VoL X X X , No. 2 —3, 2000 Homographic wavelet analysis in identification of characteristic image features T adeusz Niedziela, Artur Stankiewicz Institute of Applied Physics, Military University of Technology, ul. Kaliskiego 2, 00-908 Warszawa, Poland. Mirosław Świętochowski Department of Physics, Warsaw University, ul. Hoża 69, 00-681 Warszawa, Poland. Wavelet transformations connected with subgroups SL(2, C\ performed as homographic transfor­ mations of a plane have been applied to identification of characteristic features of two-dimensional images. It has been proven that wavelet transformations exist for symmetry groups S17( 1,1) and SL(2.R). 1. Introduction In the present work, the problem of an analysis, processing and recognition of a two-dimensional image has been studied by means of wavelet analysis connected with subgroups of GL(2, C) group, acting in a plane by homographies hA(z) = - -- - -j , CZ + fl where A -(::)eG L (2, C). The existence of wavelet reversible transformations has been proven for individual subgroups in the group of homographic transfor­ mations. The kind of wavelet analysis most often used in technical applications is connected with affine subgroup h(z) = az + b, a. case for A = ^ of the symmetry of plane £ ~ S2 maintaining points at infinity [1], [2]. Adoption of the wider symmetry group means rejection of the invariability of certain image features, which is reasonable if the problem has a certain symmetry or lacks affine symmetry. The application of wavelet analysis connected with a wider symmetry group is by no means the loss of information. On the contrary, the information is duplicated for additional symmetries or coded by other means.
    [Show full text]
  • 1 Affine and Projective Coordinate Notation 2 Transformations
    CS348a: Computer Graphics Handout #9 Geometric Modeling Original Handout #9 Stanford University Tuesday, 3 November 1992 Original Lecture #2: 6 October 1992 Topics: Coordinates and Transformations Scribe: Steve Farris 1 Affine and Projective Coordinate Notation Recall that we have chosen to denote the point with Cartesian coordinates (X,Y) in affine coordinates as (1;X,Y). Also, we denote the line with implicit equation a + bX + cY = 0as the triple of coefficients [a;b,c]. For example, the line Y = mX + r is denoted by [r;m,−1],or equivalently [−r;−m,1]. In three dimensions, points are denoted by (1;X,Y,Z) and planes are denoted by [a;b,c,d]. This transfer of dimension is natural for all dimensions. The geometry of the line — that is, of one dimension — is a little strange, in that hyper- planes are points. For example, the hyperplane with coefficients [3;7], which represents all solutions of the equation 3 + 7X = 0, is the same as the point X = −3/7, which we write in ( −3) coordinates as 1; 7 . 2 Transformations 2.1 Affine Transformations of a line Suppose F(X) := a + bX and G(X) := c + dX, and that we want to compose these functions. One way to write the two possible compositions is: G(F(X)) = c + d(a + bX)=(c + da)+bdX and F(G(X)) = a + b(c + d)X =(a + bc)+bdX. Note that it makes a difference which function we apply first, F or G. When writing the compositions above, we used prefix notation, that is, we wrote the func- tion on the left and its argument on the right.
    [Show full text]