DOCSLIB.ORG

Solutions of Homework C3(9) 1 Four Points A, B, C, D Are Given on the Projective Line RP1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Solutions of Homework C3(9) 1 Four Points A, B, C, D Are Given on the Projective Line RP1 Solutions of Homework C3(9) 1 Four points A; B; C; D are given on the projective line RP1. Their homogeneous coordinates are A = [2 : 2] ;B = [1 : 5] ;C = [3 : 7] ;D = [2 : 1] : x Calculate the affine coordinate u of these points, (u = y ) and calculate cross-ratio of these points. 2 1 3 2 u = = 1 ; u = ; u = ; u = = 2 : A 2 B 5 C 7 D 1 Calculate the cross-ratio (A; B; C; D). All points have finite coordinate (they are not at infinity). Thus we can calculate the cross-ratio using affine coordinate u. (u − u )(u − u ) (A; B; C; D) = A C B D = (1a) (uA − uD)(uB − uC ) 3 1 1 − 7 5 − 2 9 = 1 3 = − : (1 − 2) 5 − 7 4 Sure one can calculate the cross-ratio using homogeneous coordinates. (This works for any four points not only for finite points): x x x x det A C det B D y y y y (A; B; C; D) = A C B D = (1b) x x x x det A D det B C yA yD yB yC 2 3 1 2 det det 2 7 5 1 8 · (−9) 9 = = = − : 2 2 1 3 (−2) · (−8) 2 det det 2 1 5 7 2 As usual denote by (A; B; C; D) the cross-ratio of the four points A; B; C; D on the projective line. a) Does the cross-ratio change if we change the order of these points? b) Let (A; B; C; D) = λ. Calculate the cross-ratios (B; A; C; D), (A; B; D; C) and (B; A; D; C). ∗ Calculate cross- ratio (A; C; B; D). ∗ Calculate cross-ratio of arbitrary permutation of the points A; B; C; D. We see from definition of cross-ratio that it depends on the order of the points. Show that 1 (B; A; C; D) = if (A; B; C; D) = λ ; (2a) λ 1 and the same is for permutation (A; B; D; C) 1 (A; B; D; C) = if (A; B; C; D) = λ ; (2a0) λ and 00 (A; B; C; D) = (C; D; B; A) : (2a ) 00 First prove relation (2a ) It follows from equation (1a) that (u − u )(u − u ) (u − u )(u − u ) (C; D; A; B) = C A D B = A C B D = (A; B; C; D) : (uC − uB)(uD − uA) (uA − uD)(uB − uC ) Now prove relation (2a) It follows from equation (1a) that (u − u )(u − u ) 1 1 (B; A; C; D) = B C A D = = : (u −u )(u −u ) (uB − uD)(uA − uC ) A C B D (A; B; C; D) (uA−uD )(uB −uC ) Relation (2a') can be proved analogously. 00 Remark 1Sure relations (2a) and (2a') inply relation (2a ). Remark 2 Strictly speaking one cannot use formula (1a) for affine coordinates in the case if one of points is at infinity. On the other hand one can see using continuity arguments that formulae (2a,2a') are valid for arbitrary points if they are valid for finite points (see also the second solution of next exercise). (Sure one can straightforwardly apply formulae (1b) for homogeneus coordinates.) Remark 3 Cross-ratio cannot take value 1. 00 ∗ Relations (2a,2a') and (2a ) induce natural question. How transform cross-ration under arbitrary permutation of four points. One can see by direct calculation that (A; B; C; D) + (A; C; B; D) = 1 : (2b) 00 Relations (2a,2a',2a and 2b) define action of permutation group S4 on cross-ratio: 1 1 1 (A; C; D; B) = = = ; (A; C; B; D) 1 − (A; B; C; D) 1 − λ 1 1 (B; C; A; D) = 1 − (B; A; C; D) = 1 − = 1 − ; (A; B; C; D) λ and so on. 3 Four points A; B; C; D sre given on the projective line. Show that the cross-ratio u − u (A; B; C; D) = A C uB − uC 2 in the case if point D is at infinity. Choose homogeneous coordinates of these points: A = [xA : yA] = [uA : 1] ;B = [xB : yB] = [uB : 1] ;C = [xC : yC ] = [uC : 1] ; andD = [1 : 0] since the point D is at infinity. According formula (1b) we have: (A; B; C; D) = x x x x u u u 1 det A C det B D det A C det B y y y y 1 1 1 0 u − u A C B D = = A C x x x x u 1 u u u − u det A D det B C det A det B C B C yA yD yB yC 1 0 1 1 Second solution In spite of the fact that point D is at infinity one can still apply formula (1a) using continuity considerations: instead coordinate uD = 1 we will put a big N, then consider a limit N ! 1: (u − u )(u − u ) (u − u )(u − N) u − u (A; B; C; D) = A C B D = lim A C B = A C (uA − uD)(uB − uC ) N!infty (uA − N)(uB − uC ) uB − uD uB −N since limN!infty = 1. uA−N 4 Four points A; B; C; D 2 RP2 are given in homogeneous coordinates by 9 1 A = [1 : −1 : 1] ;B = [10 : −15 : 5] ;C = 1 : − : ;D = [1 : 0 : 2] : 5 5 Show that these points are collinear. Calculate their cross-ratio. First show that these points are collinear. We will do it in two different ways 1-st solution All these four points are not at infinity. Calculate coordinates (u; v) of x y these points on the projective plane (u = z ; v = z ) xA yA xB yB uA = = 1 ; vA = = −1 ; uB = = 2 ; vB = = −3 ; zA zA zB zB xC yC xD 1 yD uC = = 5 ; vC = = −9 ; uD = = ; vD = = 0 : (3) zC zC zD 2 zD One can see that all these points belong to the same line 2u + v = 1: 2uA + vA = 2uB + vB = 2uC + vC = 2uD + vD = 1 ; i.e. all these points belong to the same line, and they are collinear. Second way to see why these points are collinear: 3 One can do it also using homogeneous coordinates: One can see that 9 1 A = [1 : −1 : 1] B = [10 : −15 : 5] ;C = 1 : − : = [5 : −9 : 1] ;D = [1 : 0 : 2] ; 5 5 and both matrices TABC , TABD corresponding to triples of points (A; B; C) and (B; C; D) are degenerate 0 1 5 1 1 0 1 2 1 1 det TACD = det @ −1 −9 0 A = 0 ; det TABD = det @ −1 −3 0 A = 0 : 1 1 2 1 1 2 This means that points A; B; D are collinear and points A; C; D are collienar also. We see that all these points belong to the line lAD; they all are collinear. Now calculate cross-ratio of points A; B; C; D. We see that all these points have distinct coordinate u (see equation (3)). Calculate cross-ratio using this affine coordinate: 1 (uA − uC )(uB − uD) (1 − 5) 2 − 2 (A; B; C; D) = = 1 = 4 : (uA − uD)(uB − uC ) 1 − 2 (2 − 5) One can calculate cross-ratio using instead affine coordinate u, another affine coordinate v: (v − v )(v − v ) (−1 + 9) (−3 − 0) (A; B; C; D) = A C B D = = 4 : (vA − vD)(vB − vC ) (−1 − 0) (−3 − (−9)) 5 Two points A; B 2 RP2 are given in homogeneous coordinates, A = [2 : 2 : 4], B = [3 : 7 : 2]. Consider the projective line AB passing through the points A; B. Show that the point C = [1 : 2 : 1] belongs to the line AB, i.e. the points A; B; C are collinear. Show that a point Eλ,µ = [2λ + 3µ : 2λ + 7µ : 4λ + 2µ] where λ, µ are arbitrary real numbers belongs to the line AB Show that the point K = [2 : 0 : 1] does not belong to the line AB, i.e. the points A; B; K are not collinear. Consider a point D = [1 : 3 : 0] which is at infinity. Show that this point is collinear with the points A and B, i.e. it also belongs to the projective line AB. ∗ Calculate the cross-ratio (A; B; C; D). Let X = [a : b : c] be an arbitrary point on the projective plane RP2. Consider the matrix 0 2 3 a 1 TABX = @ 2 7 b A : (5) 4 2 c We know that a point X = [a : b : c] belongs to the line AB which passes through points A = [2 : 2 : 4] and B = [3 : 7 : 2], i.e. points A; B and X are collinear if and only if matrix 4 TABX is degenerate, i.e. det TABX = 0. Recall the geometrical meaning of this condition. The point X 2 RP2 is represented by the line in R3 which passes trhough origin and the 3 point (a; b; c) 2 R , i.e. the line directed along the vector r(a;b;c) attached at the origin. (This line represents the point X = [a : b : c].) The line AB 2 RP2 on the projective plane is represented by the plane in R3 which passes through origin and the points (2; 2; 4) 2 R3, (3; 7; 2) 2 R3, i.e. the plane which is spanned by the linear combination of the vectors r(2;2;4) and r(3;7;4). Hence X 2 lAB means that the vector r(a:b;c) is linear combination of vectors r(2;2;4) and r(3;7;4). In other words the third column of the matrix TABX in equation (5) is linear combination of first and second column, i.e.
Load more

Recommended publications
  • Projective Geometry: a Short Introduction
    Projective Geometry: A Short Introduction Lecture Notes Edmond Boyer Master MOSIG Introduction to Projective Geometry Contents 1 Introduction 2 1.1 Objective . .2 1.2 Historical Background . .3 1.3 Bibliography . .4 2 Projective Spaces 5 2.1 Definitions . .5 2.2 Properties . .8 2.3 The hyperplane at infinity . 12 3 The projective line 13 3.1 Introduction . 13 3.2 Projective transformation of P1 ................... 14 3.3 The cross-ratio . 14 4 The projective plane 17 4.1 Points and lines . 17 4.2 Line at infinity . 18 4.3 Homographies . 19 4.4 Conics . 20 4.5 Affine transformations . 22 4.6 Euclidean transformations . 22 4.7 Particular transformations . 24 4.8 Transformation hierarchy . 25 Grenoble Universities 1 Master MOSIG Introduction to Projective Geometry Chapter 1 Introduction 1.1 Objective The objective of this course is to give basic notions and intuitions on projective geometry. The interest of projective geometry arises in several visual comput- ing domains, in particular computer vision modelling and computer graphics. It provides a mathematical formalism to describe the geometry of cameras and the associated transformations, hence enabling the design of computational ap- proaches that manipulates 2D projections of 3D objects. In that respect, a fundamental aspect is the fact that objects at infinity can be represented and manipulated with projective geometry and this in contrast to the Euclidean geometry. This allows perspective deformations to be represented as projective transformations. Figure 1.1: Example of perspective deformation or 2D projective transforma- tion. Another argument is that Euclidean geometry is sometimes difficult to use in algorithms, with particular cases arising from non-generic situations (e.g.
    [Show full text]
  • 2D and 3D Transformations, Homogeneous Coordinates Lecture 03
    2D and 3D Transformations, Homogeneous Coordinates Lecture 03 Patrick Karlsson [email protected] Centre for Image Analysis Uppsala University Computer Graphics November 6 2006 Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 1 / 23 Reading Instructions Chapters 4.1–4.9. Edward Angel. “Interactive Computer Graphics: A Top-down Approach with OpenGL”, Fourth Edition, Addison-Wesley, 2004. Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 2 / 23 Todays lecture ... in the pipeline Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 3 / 23 Scalars, points, and vectors Scalars α, β Real (or complex) numbers. Points P, Q Locations in space (but no size or shape). Vectors u, v Directions in space (magnitude but no position). Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 4 / 23 Mathematical spaces Scalar field A set of scalars obeying certain properties. New scalars can be formed through addition and multiplication. (Linear) Vector space Made up of scalars and vectors. New vectors can be created through scalar-vector multiplication, and vector-vector addition. Affine space An extended vector space that include points. This gives us additional operators, such as vector-point addition, and point-point subtraction. Patrick Karlsson (Uppsala University) Transformations and Homogeneous Coords. Computer Graphics 5 / 23 Data types Polygon based objects Objects are described using polygons. A polygon is defined by its vertices (i.e., points). Transformations manipulate the vertices, thus manipulates the objects. Some examples in 2D Scalar α 1 float. Point P(x, y) 2 floats. Vector v(x, y) 2 floats. Matrix M 4 floats.
    [Show full text]
  • 2-D Drawing Geometry Homogeneous Coordinates
    2-D Drawing Geometry Homogeneous Coordinates The rotation of a point, straight line or an entire image on the screen, about a point other than origin, is achieved by first moving the image until the point of rotation occupies the origin, then performing rotation, then finally moving the image to its original position. The moving of an image from one place to another in a straight line is called a translation. A translation may be done by adding or subtracting to each point, the amount, by which picture is required to be shifted. Translation of point by the change of coordinate cannot be combined with other transformation by using simple matrix application. Such a combination is essential if we wish to rotate an image about a point other than origin by translation, rotation again translation. To combine these three transformations into a single transformation, homogeneous coordinates are used. In homogeneous coordinate system, two-dimensional coordinate positions (x, y) are represented by triple- coordinates. Homogeneous coordinates are generally used in design and construction applications. Here we perform translations, rotations, scaling to fit the picture into proper position 2D Transformation in Computer Graphics- In Computer graphics, Transformation is a process of modifying and re- positioning the existing graphics. • 2D Transformations take place in a two dimensional plane. • Transformations are helpful in changing the position, size, orientation, shape etc of the object. Transformation Techniques- In computer graphics, various transformation techniques are- 1. Translation 2. Rotation 3. Scaling 4. Reflection 2D Translation in Computer Graphics- In Computer graphics, 2D Translation is a process of moving an object from one position to another in a two dimensional plane.
    [Show full text]
  • Projective Geometry Lecture Notes
    Projective Geometry Lecture Notes Thomas Baird March 26, 2014 Contents 1 Introduction 2 2 Vector Spaces and Projective Spaces 4 2.1 Vector spaces and their duals . 4 2.1.1 Fields . 4 2.1.2 Vector spaces and subspaces . 5 2.1.3 Matrices . 7 2.1.4 Dual vector spaces . 7 2.2 Projective spaces and homogeneous coordinates . 8 2.2.1 Visualizing projective space . 8 2.2.2 Homogeneous coordinates . 13 2.3 Linear subspaces . 13 2.3.1 Two points determine a line . 14 2.3.2 Two planar lines intersect at a point . 14 2.4 Projective transformations and the Erlangen Program . 15 2.4.1 Erlangen Program . 16 2.4.2 Projective versus linear . 17 2.4.3 Examples of projective transformations . 18 2.4.4 Direct sums . 19 2.4.5 General position . 20 2.4.6 The Cross-Ratio . 22 2.5 Classical Theorems . 23 2.5.1 Desargues' Theorem . 23 2.5.2 Pappus' Theorem . 24 2.6 Duality . 26 3 Quadrics and Conics 28 3.1 Affine algebraic sets . 28 3.2 Projective algebraic sets . 30 3.3 Bilinear and quadratic forms . 31 3.3.1 Quadratic forms . 33 3.3.2 Change of basis . 33 1 3.3.3 Digression on the Hessian . 36 3.4 Quadrics and conics . 37 3.5 Parametrization of the conic . 40 3.5.1 Rational parametrization of the circle . 42 3.6 Polars . 44 3.7 Linear subspaces of quadrics and ruled surfaces . 46 3.8 Pencils of quadrics and degeneration . 47 4 Exterior Algebras 52 4.1 Multilinear algebra .
    [Show full text]
  • Chapter 12 the Cross Ratio
    Chapter 12 The cross ratio Math 4520, Fall 2017 We have studied the collineations of a projective plane, the automorphisms of the underlying field, the linear functions of Affine geometry, etc. We have been led to these ideas by various problems at hand, but let us step back and take a look at one important point of view of the big picture. 12.1 Klein's Erlanger program In 1872, Felix Klein, one of the leading mathematicians and geometers of his day, in the city of Erlanger, took the following point of view as to what the role of geometry was in mathematics. This is from his \Recent trends in geometric research." Let there be given a manifold and in it a group of transforma- tions; it is our task to investigate those properties of a figure belonging to the manifold that are not changed by the transfor- mation of the group. So our purpose is clear. Choose the group of transformations that you are interested in, and then hunt for the \invariants" that are relevant. This search for invariants has proved very fruitful and useful since the time of Klein for many areas of mathematics, not just classical geometry. In some case the invariants have turned out to be simple polynomials or rational functions, such as the case with the cross ratio. In other cases the invariants were groups themselves, such as homology groups in the case of algebraic topology. 12.2 The projective line In Chapter 11 we saw that the collineations of a projective plane come in two \species," projectivities and field automorphisms.
    [Show full text]
  • Homogeneous Representations of Points, Lines and Planes
    Chapter 5 Homogeneous Representations of Points, Lines and Planes 5.1 Homogeneous Vectors and Matrices ................................. 195 5.2 Homogeneous Representations of Points and Lines in 2D ............... 205 n 5.3 Homogeneous Representations in IP ................................ 209 5.4 Homogeneous Representations of 3D Lines ........................... 216 5.5 On Plücker Coordinates for Points, Lines and Planes .................. 221 5.6 The Principle of Duality ........................................... 229 5.7 Conics and Quadrics .............................................. 236 5.8 Normalizations of Homogeneous Vectors ............................. 241 5.9 Canonical Elements of Coordinate Systems ........................... 242 5.10 Exercises ........................................................ 245 This chapter motivates and introduces homogeneous coordinates for representing geo- metric entities. Their name is derived from the homogeneity of the equations they induce. Homogeneous coordinates represent geometric elements in a projective space, as inhomoge- neous coordinates represent geometric entities in Euclidean space. Throughout this book, we will use Cartesian coordinates: inhomogeneous in Euclidean spaces and homogeneous in projective spaces. A short course in the plane demonstrates the usefulness of homogeneous coordinates for constructions, transformations, estimation, and variance propagation. A characteristic feature of projective geometry is the symmetry of relationships between points and lines, called
    [Show full text]
  • Single View Geometry Camera Model & Orientation + Position Estimation
    Single View Geometry Camera model & Orientation + Position estimation What am I? Vanishing point Mapping from 3D to 2D Point & Line Goal: Homogeneous coordinates Point – represent coordinates in 2 dimensions with a 3-vector &x# &x# homogeneous coords $y! $ ! ''''''→$ ! %y" %$1"! The projective plane • Why do we need homogeneous coordinates? – represent points at infinity, homographies, perspective projection, multi-view relationships • What is the geometric intuition? – a point in the image is a ray in projective space y (sx,sy,s) (x,y,1) (0,0,0) z x image plane • Each point (x,y) on the plane is represented by a ray (sx,sy,s) – all points on the ray are equivalent: (x, y, 1) ≅ (sx, sy, s) Projective Lines Projective lines • What does a line in the image correspond to in projective space? • A line is a plane of rays through origin – all rays (x,y,z) satisfying: ax + by + cz = 0 ⎡x⎤ in vector notation : 0 a b c ⎢y⎥ = [ ]⎢ ⎥ ⎣⎢z⎦⎥ l p • A line is also represented as a homogeneous 3-vector l Line Representation • a line is • is the distance from the origin to the line • is the norm direction of the line • It can also be written as Example of Line Example of Line (2) 0.42*pi Homogeneous representation Line in Is represented by a point in : But correspondence of line to point is not unique We define set of equivalence class of vectors in R^3 - (0,0,0) As projective space Projective lines from two points Line passing through two points Two points: x Define a line l is the line passing two points Proof: Line passing through two points • More
    [Show full text]
  • 6. the Riemann Sphere It Is Sometimes Convenient to Add a Point at Infinity ∞ to the Usual Complex Plane to Get the Extended Complex Plane
    6. The Riemann sphere It is sometimes convenient to add a point at infinity 1 to the usual complex plane to get the extended complex plane. Definition 6.1. The extended complex plane, denoted P1, is simply the union of C and the point at infinity. It is somewhat curious that when we add points at infinity to the reals we add two points ±∞ but only only one point for the complex numbers. It is rare in geometry that things get easier as you increase the dimension. One very good way to understand the extended complex plane is to realise that P1 is naturally in bijection with the unit sphere: Definition 6.2. The Riemann sphere is the unit sphere in R3: 2 3 2 2 2 S = f (x; y; z) 2 R j x + y + z = 1 g: To make a correspondence with the sphere and the plane is simply to make a map (a real map not a function). We define a function 2 3 F : S − f(0; 0; 1)g −! C ⊂ R as follows. Pick a point q = (x; y; z) 2 S2, a point of the unit sphere, other than the north pole p = N = (0; 0; 1). Connect the point p to the point q by a line. This line will meet the plane z = 0, 2 f (x; y; 0) j (x; y) 2 R g in a unique point r. We then identify r with a point F (q) = x + iy 2 C in the usual way. F is called stereographic projection.
    [Show full text]
  • 2 Lie Groups
    2 Lie Groups Contents 2.1 Algebraic Properties 25 2.2 Topological Properties 27 2.3 Unification of Algebra and Topology 29 2.4 Unexpected Simplification 31 2.5 Conclusion 31 2.6 Problems 32 Lie groups are beautiful, important, and useful because they have one foot in each of the two great divisions of mathematics — algebra and geometry. Their algebraic properties derive from the group axioms. Their geometric properties derive from the identification of group operations with points in a topological space. The rigidity of their structure comes from the continuity requirements of the group composition and inversion maps. In this chapter we present the axioms that define a Lie group. 2.1 Algebraic Properties The algebraic properties of a Lie group originate in the axioms for a group. Definition: A set gi,gj,gk,... (called group elements or group oper- ations) together with a combinatorial operation (called group multi- ◦ plication) form a group G if the following axioms are satisfied: (i) Closure: If g G, g G, then g g G. i ∈ j ∈ i ◦ j ∈ (ii) Associativity: g G, g G, g G, then i ∈ j ∈ k ∈ (g g ) g = g (g g ) i ◦ j ◦ k i ◦ j ◦ k 25 26 Lie Groups (iii) Identity: There is an operator e (the identity operation) with the property that for every group operation g G i ∈ g e = g = e g i ◦ i ◦ i −1 (iv) Inverse: Every group operation gi has an inverse (called gi ) with the property g g−1 = e = g−1 g i ◦ i i ◦ i Example: We consider the set of real 2 2 matrices SL(2; R): × α β A = det(A)= αδ βγ = +1 (2.1) γ δ − where α,β,γ,δ are real numbers.
    [Show full text]
  • Euclidean Versus Projective Geometry
    Projective Geometry Projective Geometry Euclidean versus Projective Geometry n Euclidean geometry describes shapes “as they are” – Properties of objects that are unchanged by rigid motions » Lengths » Angles » Parallelism n Projective geometry describes objects “as they appear” – Lengths, angles, parallelism become “distorted” when we look at objects – Mathematical model for how images of the 3D world are formed. Projective Geometry Overview n Tools of algebraic geometry n Informal description of projective geometry in a plane n Descriptions of lines and points n Points at infinity and line at infinity n Projective transformations, projectivity matrix n Example of application n Special projectivities: affine transforms, similarities, Euclidean transforms n Cross-ratio invariance for points, lines, planes Projective Geometry Tools of Algebraic Geometry 1 n Plane passing through origin and perpendicular to vector n = (a,b,c) is locus of points x = ( x 1 , x 2 , x 3 ) such that n · x = 0 => a x1 + b x2 + c x3 = 0 n Plane through origin is completely defined by (a,b,c) x3 x = (x1, x2 , x3 ) x2 O x1 n = (a,b,c) Projective Geometry Tools of Algebraic Geometry 2 n A vector parallel to intersection of 2 planes ( a , b , c ) and (a',b',c') is obtained by cross-product (a'',b'',c'') = (a,b,c)´(a',b',c') (a'',b'',c'') O (a,b,c) (a',b',c') Projective Geometry Tools of Algebraic Geometry 3 n Plane passing through two points x and x’ is defined by (a,b,c) = x´ x' x = (x1, x2 , x3 ) x'= (x1 ', x2 ', x3 ') O (a,b,c) Projective Geometry Projective Geometry
    [Show full text]
  • 1 Homogeneous Coordinates and Vanishing Points
    CSE 152: Solutions to Assignment 1 Spring 2006 1 Homogeneous Coordinates and Vanishing Points In class, we discussed the concept of homogeneous coordinates. In this example, we will confine ourselves to the real 2D plane. A point (x, y)> on the real 2D plane can be represented in homo- geneous coordinates by a 3-vector (wx, wy, w)>, where w 6= 0 is any real number. All values of w 6= 0 represent the same 2D point. Dividing out the third coordinate of a homogeneous point x y > (x, y, z) converts it back to its 2D equivalent: , . z z Consider a line in the 2D plane, whose equation is given by ax + by + c = 0. This can equiv- alently be written as l>x = 0, where l = (a, b, c)> and x = (x, y, 1)>. Noticing that x is a ho- mogeneous representation of (x, y)>, we define l as a homogeneous representation of the line ax + by + c = 0. Note that the line (ka)x + (kb)y + (kc) = 0 for k 6= 0 is the same as the line ax + by + c = 0, so the homogeneous representation of the line ax + by + c = 0 can be equivalently given by (a, b, c)> or (ka, kb, kc)> for any k 6= 0. All points (x, y) that lie on the line ax + by + c = 0 satisfy the equation l>x = 0, thus, we can say that a condition for a homogeneous point x to lie on the homogeneous line l is that their dot product is zero, that is, l>x = 0.
    [Show full text]
  • Homogeneous Coordinates
    Homogeneous Coordinates Jules Bloomenthal and Jon Rokne Department of Computer Science The University of Calgary Introduction Homogeneous coordinates have a natural application to Computer Graphics; they form a basis for the projective geometry used extensively to project a three-dimensional scene onto a two- dimensional image plane. They also unify the treatment of common graphical transformations and operations. The graphical use of homogeneous coordinates is due to [Roberts, 1965], and an early review is presented by [Ahuja, 1968]. Today, homogeneous coordinates are presented in numerous computer graphics texts (such as [Foley, Newman, Rogers, Qiulin and Davies]); [Newman], in particular, provides an appendix of homogeneous techniques. [Riesenfeld] provides an excellent introduction to homogeneous coordinates and their algebraic, geometric and topological significance to Computer Graphics. [Bez] further discusses their algebraic and topological properties, and [Blinn77, Blinn78] develop additional applications for Computer Graphics. Homogeneous coordinates are also used in the related areas of CAD/CAM [Zeid], robotics [McKerrow], surface modeling [Farin], and computational projective geometry [Kanatani]. They can also extend the number range for fixed point arithmetic [Rogers]. Our aim here is to provide an intuitive yet theoretically based discussion that assembles the key features of homogeneous coordinates and their applications to Computer Graphics. These applications include affine transformations, perspective projection, line intersections, clipping, and rational curves and surfaces. For the sake of clarity in accompanying illustrations, we confine our 1 2 development to two dimensions and then use the intuition gained to present the application of homogeneous coordinates to three dimensions. None of the material presented here is new; rather, we have tried to collect in one place diverse but related methods.
    [Show full text]