Homogeneous coordinates

Coordinate system used in projective geometry

Rational Bézier curve - polynomial curve defined in homogeneous coordinates (blue) and its projection on plane - rational curve (red)

In mathematics, homogeneous coordinates or projective coordinates, introduced by August Ferdinand Möbius in his 1827 work Der barycentrische Calcul,[1][2][3] are a system of coordinates used in projective geometry, just as Cartesian coordinates are used in Euclidean geometry. They have the advantage that the coordinates of points, including points at infinity, can be represented using finite coordinates. Formulas involving homogeneous coordinates are often simpler and more symmetric than their Cartesian counterparts. Homogeneous coordinates have a range of applications, including computer graphics and 3D computer vision, where they allow affine transformations and, in general, projective transformations to be easily represented by a matrix. They are also used in fundamental elliptic curve cryptography algorithms.[4]

If homogeneous coordinates of a point are multiplied by a non-zero scalar then the resulting coordinates represent the same point. Since homogeneous coordinates are also given to points at infinity, the number of coordinates required to allow this extension is one more than the dimension of the projective space being considered. For example, two homogeneous coordinates are required to specify a point on the projective line and three homogeneous coordinates are required to specify a point in the projective plane.

## Introduction

[edit]

The real projective plane can be thought of as the Euclidean plane with additional points added, which are called points at infinity, and are considered to lie on a new line, the line at infinity. There is a point at infinity corresponding to each direction (numerically given by the slope of a line), informally defined as the limit of a point that moves in that direction away from the origin. Parallel lines in the Euclidean plane are said to intersect at a point at infinity corresponding to their common direction. Given a point  ( x , y ) {\displaystyle (x,y)} on the Euclidean plane, for any non-zero real number  Z {\displaystyle Z} , the triple  ( x Z , y Z , Z ) {\displaystyle (xZ,yZ,Z)} is called a set of homogeneous coordinates for the point. By this definition, multiplying the three homogeneous coordinates by a common, non-zero factor gives a new set of homogeneous coordinates for the same point. In particular,  ( x , y , 1 ) {\displaystyle (x,y,1)} is such a system of homogeneous coordinates for the point  ( x , y ) {\displaystyle (x,y)} . For example, the Cartesian point  ( 1 , 2 ) {\displaystyle (1,2)} can be represented in homogeneous coordinates as  ( 1 , 2 , 1 ) {\displaystyle (1,2,1)} or  ( 2 , 4 , 2 ) {\displaystyle (2,4,2)} . The original Cartesian coordinates are recovered by dividing the first two positions by the third. Thus unlike Cartesian coordinates, a single point can be represented by infinitely many homogeneous coordinates.

The equation of a line through the origin  ( 0 , 0 ) {\displaystyle (0,0)} may be written  n x + m y = 0 {\displaystyle nx+my=0} where  n {\displaystyle n} and  m {\displaystyle m} are not both  0 {\displaystyle 0} . In parametric form this can be written  x = m t , y = − n t {\displaystyle x=mt,y=-nt} . Let  Z = 1 / t {\displaystyle Z=1/t} , so the coordinates of a point on the line may be written  ( m / Z , − n / Z ) {\displaystyle (m/Z,-n/Z)} . In homogeneous coordinates this becomes  ( m , − n , Z ) {\displaystyle (m,-n,Z)} . In the limit, as  t {\displaystyle t} approaches infinity, in other words, as the point moves away from the origin,  Z {\displaystyle Z} approaches  0 {\displaystyle 0} and the homogeneous coordinates of the point become  ( m , − n , 0 ) {\displaystyle (m,-n,0)} . Thus we define  ( m , − n , 0 ) {\displaystyle (m,-n,0)} as the homogeneous coordinates of the point at infinity corresponding to the direction of the line  n x + m y = 0 {\displaystyle nx+my=0} . As any line of the Euclidean plane is parallel to a line passing through the origin, and since parallel lines have the same point at infinity, the infinite point on every line of the Euclidean plane has been given homogeneous coordinates.

To summarize:

* Any point in the projective plane is represented by a triple  ( X , Y , Z ) {\displaystyle (X,Y,Z)} , called 'homogeneous coordinates' or 'projective coordinates' of the point, where  X {\displaystyle X} ,  Y {\displaystyle Y} and  Z {\displaystyle Z} are not all  0 {\displaystyle 0} .
* The point represented by a given set of homogeneous coordinates is unchanged if the coordinates are multiplied by a common factor.
* Conversely, two sets of homogeneous coordinates represent the same point if and only if one is obtained from the other by multiplying all the coordinates by the same non-zero constant.
* When  Z {\displaystyle Z} is not  0 {\displaystyle 0} the point represented is the point  ( X / Z , Y / Z ) {\displaystyle (X/Z,Y/Z)} in the Euclidean plane.
* When  Z {\displaystyle Z} is  0 {\displaystyle 0} the point represented is a point at infinity.

The triple  ( 0 , 0 , 0 ) {\displaystyle (0,0,0)} is omitted and does not represent any point. The origin of the Euclidean plane is represented by  ( 0 , 0 , 1 ) {\displaystyle (0,0,1)} .[5]

### Notation

[edit]

Some authors use different notations for homogeneous coordinates which help distinguish them from Cartesian coordinates. The use of colons instead of commas, for example  ( x : y : z ) {\displaystyle (x:y:z)} instead of  ( x , y , z ) {\displaystyle (x,y,z)} , emphasizes that the coordinates are to be considered ratios.[6] Square brackets, as in  [ x , y , z ] {\displaystyle [x,y,z]} emphasize that multiple sets of coordinates are associated with a single point.[7] Some authors use a combination of colons and square brackets, as in  [ x : y : z ] {\displaystyle [x:y:z]} .[8]

## Other dimensions

[edit]

The discussion in the preceding section applies analogously to projective spaces other than the plane. So the points on the projective line may be represented by pairs of coordinates  ( x , y ) {\displaystyle (x,y)} , not both zero. In this case, the point at infinity is  ( 1 , 0 ) {\displaystyle (1,0)} . Similarly the points in projective  n {\displaystyle n} -space are represented by  ( n + 1 ) {\displaystyle (n+1)} -tuples.[9]

## Other projective spaces

[edit]

The use of real numbers gives homogeneous coordinates of points in the classical case of the real projective spaces, however any field may be used, in particular, the complex numbers may be used for complex projective space. For example, the complex projective line uses two homogeneous complex coordinates and is known as the Riemann sphere. Other fields, including finite fields, can be used.

Homogeneous coordinates for projective spaces can also be created with elements from a division ring (a skew field). However, in this case, care must be taken to account for the fact that multiplication may not be commutative.[10]

For the general ring A, a projective line over A can be defined with homogeneous factors acting on the left and the projective linear group acting on the right.

## Alternative definition

[edit]

Another definition of the real projective plane can be given in terms of equivalence classes. For non-zero elements of  R 3 {\displaystyle \mathbb {R} ^{3}} , define  ( x 1 , y 1 , z 1 ) ∼ ( x 2 , y 2 , z 2 ) {\displaystyle (x_{1},y_{1},z_{1})\sim (x_{2},y_{2},z_{2})} to mean there is a non-zero  λ {\displaystyle \lambda } so that  ( x 1 , y 1 , z 1 ) = ( λ x 2 , λ y 2 , λ z 2 ) {\displaystyle (x_{1},y_{1},z_{1})=(\lambda x_{2},\lambda y_{2},\lambda z_{2})} . Then  ∼ {\displaystyle \sim } is an equivalence relation and the projective plane can be defined as the equivalence classes of  R 3 ∖ { 0 } . {\displaystyle \mathbb {R} ^{3}\setminus \left\\{0\right\\}.} If  ( x , y , z ) {\displaystyle (x,y,z)} is one of the elements of the equivalence class  p {\displaystyle p} then these are taken to be homogeneous coordinates of  p {\displaystyle p} .

Lines in this space are defined to be sets of solutions of equations of the form  a x + b y + c z = 0 {\displaystyle ax+by+cz=0} where not all of  a {\displaystyle a} ,  b {\displaystyle b} and  c {\displaystyle c} are zero. Satisfaction of the condition  a x + b y + c z = 0 {\displaystyle ax+by+cz=0} depends only on the equivalence class of  ( x , y , z ) , {\displaystyle (x,y,z),} so the equation defines a set of points in the projective plane. The mapping  ( x , y ) -> ( x , y , 1 ) {\displaystyle (x,y)\rightarrow (x,y,1)} defines an inclusion from the Euclidean plane to the projective plane and the complement of the image is the set of points with  z = 0 {\displaystyle z=0} . The equation  z = 0 {\displaystyle z=0} is an equation of a line in the projective plane (see definition of a line in the projective plane), and is called the line at infinity.

The equivalence classes,  p {\displaystyle p} , are the lines through the origin with the origin removed. The origin does not really play an essential part in the previous discussion so it can be added back in without changing the properties of the projective plane. This produces a variation on the definition, namely the projective plane is defined as the set of lines in  R 3 {\displaystyle \mathbb {R} ^{3}} that pass through the origin and the coordinates of a non-zero element  ( x , y , z ) {\displaystyle (x,y,z)} of a line are taken to be homogeneous coordinates of the line. These lines are now interpreted as points in the projective plane.

Again, this discussion applies analogously to other dimensions. So the projective space of dimension n can be defined as the set of lines through the origin in  R n + 1 {\displaystyle \mathbb {R} ^{n+1}} .[11]

## Homogeneity

[edit]

Homogeneous coordinates are not uniquely determined by a point, so a function defined on the coordinates, say  f ( x , y , z ) {\displaystyle f(x,y,z)} , does not determine a function defined on points as with Cartesian coordinates. But a condition  f ( x , y , z ) = 0 {\displaystyle f(x,y,z)=0} defined on the coordinates, as might be used to describe a curve, determines a condition on points if the function is homogeneous. Specifically, suppose there is a  k {\displaystyle k} such that

f ( λ x , λ y , λ z ) = λ k f ( x , y , z ) . {\displaystyle f(\lambda x,\lambda y,\lambda z)=\lambda ^{k}f(x,y,z).}

If a set of coordinates represents the same point as  ( x , y , z ) {\displaystyle (x,y,z)} then it can be written  ( λ x , λ y , λ z ) {\displaystyle (\lambda x,\lambda y,\lambda z)} for some non-zero value of  λ {\displaystyle \lambda } . Then

f ( x , y , z ) = 0 ⟺ f ( λ x , λ y , λ z ) = λ k f ( x , y , z ) = 0. {\displaystyle f(x,y,z)=0\iff f(\lambda x,\lambda y,\lambda z)=\lambda ^{k}f(x,y,z)=0.}

A polynomial g ( x , y ) {\displaystyle g(x,y)} of degree  k {\displaystyle k} can be turned into a homogeneous polynomial by replacing  x {\displaystyle x} with  x / z {\displaystyle x/z} ,  y {\displaystyle y} with  y / z {\displaystyle y/z} and multiplying by  z k {\displaystyle z^{k}} , in other words by defining

f ( x , y , z ) = z k g ( x / z , y / z ) . {\displaystyle f(x,y,z)=z^{k}g(x/z,y/z).}

The resulting function  f {\displaystyle f} is a polynomial, so it makes sense to extend its domain to triples where  z = 0 {\displaystyle z=0} . The process can be reversed by setting  z = 1 {\displaystyle z=1} , or

g ( x , y ) = f ( x , y , 1 ) . {\displaystyle g(x,y)=f(x,y,1).}

The equation  f ( x , y , z ) = 0 {\displaystyle f(x,y,z)=0} can then be thought of as the homogeneous form of  g ( x , y ) = 0 {\displaystyle g(x,y)=0} and it defines the same curve when restricted to the Euclidean plane. For example, the homogeneous form of the equation of the line  a x + b y + c = 0 {\displaystyle ax+by+c=0} is  a x + b y + c z = 0. {\displaystyle ax+by+cz=0.} [12]

## Line coordinates and duality

[edit]

Main article: Duality (projective geometry)

The equation of a line in the projective plane may be given as  s x + t y + u z = 0 {\displaystyle sx+ty+uz=0} where  s {\displaystyle s} ,  t {\displaystyle t} and  u {\displaystyle u} are constants. Each triple  ( s , t , u ) {\displaystyle (s,t,u)} determines a line, the line determined is unchanged if it is multiplied by a non-zero scalar, and at least one of  s {\displaystyle s} ,  t {\displaystyle t} and  u {\displaystyle u} must be non-zero. So the triple  ( s , t , u ) {\displaystyle (s,t,u)} may be taken to be homogeneous coordinates of a line in the projective plane, that is line coordinates as opposed to point coordinates. If in  s x + t y + u z = 0 {\displaystyle sx+ty+uz=0} the letters  s {\displaystyle s} ,  t {\displaystyle t} and  u {\displaystyle u} are taken as variables and  x {\displaystyle x} ,  y {\displaystyle y} and  z {\displaystyle z} are taken as constants then the equation becomes an equation of a set of lines in the space of all lines in the plane. Geometrically it represents the set of lines that pass through the point  ( x , y , z ) {\displaystyle (x,y,z)} and may be interpreted as the equation of the point in line-coordinates. In the same way, planes in 3-space may be given sets of four homogeneous coordinates, and so on for higher dimensions.[13]

The same relation,  s x + t y + u z = 0 {\displaystyle sx+ty+uz=0} , may be regarded as either the equation of a line or the equation of a point. In general, there is no difference either algebraically or logically between homogeneous coordinates of points and lines. So plane geometry with points as the fundamental elements and plane geometry with lines as the fundamental elements are equivalent except for interpretation. This leads to the concept of duality in projective geometry, the principle that the roles of points and lines can be interchanged in a theorem in projective geometry and the result will also be a theorem. Analogously, the theory of points in projective 3-space is dual to the theory of planes in projective 3-space, and so on for higher dimensions.[14]

## Plücker coordinates

[edit]

Main article: Plücker coordinates

Assigning coordinates to lines in projective 3-space is more complicated since it would seem that a total of 8 coordinates, either the coordinates of two points which lie on the line or two planes whose intersection is the line, are required. A useful method, due to Julius Plücker, creates a set of six coordinates as the determinants  x i y j − x j y i ( 1 ≤ i < j ≤ 4 ) {\displaystyle x_{i}y_{j}-x_{j}y_{i}(1\leq i<j\leq 4)} from the homogeneous coordinates of two points  ( x 1 , x 2 , x 3 , x 4 ) {\displaystyle (x_{1},x_{2},x_{3},x_{4})} and  ( y 1 , y 2 , y 3 , y 4 ) {\displaystyle (y_{1},y_{2},y_{3},y_{4})} on the line. The Plücker embedding is the generalization of this to create homogeneous coordinates of elements of any dimension  m {\displaystyle m} in a projective space of dimension  n {\displaystyle n} .[15][16]

## Circular points

[edit]

Main article: Circular points at infinity

The homogeneous form for the equation of a circle in the real or complex projective plane is  x 2 + y 2 + 2 a x z + 2 b y z + c z 2 = 0 {\displaystyle x^{2}+y^{2}+2axz+2byz+cz^{2}=0} . The intersection of this curve with the line at infinity can be found by setting  z = 0 {\displaystyle z=0} . This produces the equation  x 2 + y 2 = 0 {\displaystyle x^{2}+y^{2}=0} which has two solutions over the complex numbers, giving rise to the points with homogeneous coordinates  ( 1 , i , 0 ) {\displaystyle (1,i,0)} and  ( 1 , − i , 0 ) {\displaystyle (1,-i,0)} in the complex projective plane. These points are called the circular points at infinity and can be regarded as the common points of intersection of all circles. This can be generalized to curves of higher order as circular algebraic curves.[17]

## Change of coordinate systems

[edit]

Just as the selection of axes in the Cartesian coordinate system is somewhat arbitrary, the selection of a single system of homogeneous coordinates out of all possible systems is somewhat arbitrary. Therefore, it is useful to know how the different systems are related to each other.

Let  ( x , y , z {\displaystyle (x,y,z} ) be homogeneous coordinates of a point in the projective plane. A fixed matrix  A = ( a b c d e f g h i ) , {\displaystyle A={\begin{pmatrix}a&b&c\\\d&e&f\\\g&h&i\end{pmatrix}},} with nonzero determinant, defines a new system of coordinates  ( X , Y , Z ) {\displaystyle (X,Y,Z)} by the equation  ( X Y Z ) = A ( x y z ) . {\displaystyle {\begin{pmatrix}X\\\Y\\\Z\end{pmatrix}}=A{\begin{pmatrix}x\\\y\\\z\end{pmatrix}}.} Multiplication of  ( x , y , z ) {\displaystyle (x,y,z)} by a scalar results in the multiplication of  ( X , Y , Z ) {\displaystyle (X,Y,Z)} by the same scalar, and  X {\displaystyle X} ,  Y {\displaystyle Y} and  Z {\displaystyle Z} cannot be all  0 {\displaystyle 0} unless  x {\displaystyle x} ,  y {\displaystyle y} and  z {\displaystyle z} are all zero since  A {\displaystyle A} is nonsingular. So  ( X , Y , Z ) {\displaystyle (X,Y,Z)} are a new system of homogeneous coordinates for the same point of the projective plane.

## Barycentric coordinates

[edit]

Main article: Barycentric coordinates (mathematics)

Möbius's original formulation of homogeneous coordinates specified the position of a point as the center of mass (or barycenter) of a system of three point masses placed at the vertices of a fixed triangle. Points within the triangle are represented by positive masses and points outside the triangle are represented by allowing negative masses. Multiplying the masses in the system by a scalar does not affect the center of mass, so this is a special case of a system of homogeneous coordinates.

## Trilinear coordinates

[edit]

Main article: Trilinear coordinates

Let  l {\displaystyle l} ,  m {\displaystyle m} and  n {\displaystyle n} be three lines in the plane and define a set of coordinates X {\displaystyle X} ,  Y {\displaystyle Y} and  Z {\displaystyle Z} of a point  p {\displaystyle p} as the signed distances from  p {\displaystyle p} to these three lines. These are called the trilinear coordinates of  p {\displaystyle p} with respect to the triangle whose vertices are the pairwise intersections of the lines. Strictly speaking these are not homogeneous, since the values of  X {\displaystyle X} ,  Y {\displaystyle Y} and  Z {\displaystyle Z} are determined exactly, not just up to proportionality. There is a linear relationship between them however, so these coordinates can be made homogeneous by allowing multiples of  ( X , Y , Z ) {\displaystyle (X,Y,Z)} to represent the same point. More generally,  X {\displaystyle X} ,  Y {\displaystyle Y} and  Z {\displaystyle Z} can be defined as constants  p {\displaystyle p} ,  r {\displaystyle r} and  q {\displaystyle q} times the distances to  l {\displaystyle l} ,  m {\displaystyle m} and  n {\displaystyle n} , resulting in a different system of homogeneous coordinates with the same triangle of reference. This is, in fact, the most general type of system of homogeneous coordinates for points in the plane if none of the lines is the line at infinity.[18]

## Use in computer graphics and computer vision

[edit]

See also: Transformation matrix

Homogeneous coordinates are ubiquitous in computer graphics because they allow common vector operations such as translation, rotation, scaling and perspective projection to be represented as a matrix by which the vector is multiplied. By the chain rule, any sequence of such operations can be multiplied out into a single matrix, allowing simple and efficient processing. By contrast, using Cartesian coordinates, translations and perspective projection cannot be expressed as matrix multiplications, though other operations can. Modern OpenGL and Direct3D graphics cards take advantage of homogeneous coordinates to implement a vertex shader efficiently using vector processors with 4-element registers.[19][20]

For example, in perspective projection, a position in space is associated with the line from it to a fixed point called the center of projection. The point is then mapped to a plane by finding the point of intersection of that plane and the line. This produces an accurate representation of how a three-dimensional object appears to the eye. In the simplest situation, the center of projection is the origin and points are mapped to the plane  z = 1 {\displaystyle z=1} , working for the moment in Cartesian coordinates. For a given point in space,  ( x , y , z ) {\displaystyle (x,y,z)} , the point where the line and the plane intersect is  ( x / z , y / z , 1 ) {\displaystyle (x/z,y/z,1)} . Dropping the now superfluous  z {\displaystyle z} coordinate, this becomes  ( x / z , y / z ) {\displaystyle (x/z,y/z)} . In homogeneous coordinates, the point  ( x , y , z ) {\displaystyle (x,y,z)} is represented by  ( x w , y w , z w , w ) {\displaystyle (xw,yw,zw,w)} and the point it maps to on the plane is represented by  ( x w , y w , z w ) {\displaystyle (xw,yw,zw)} , so projection can be represented in matrix form as  ( 1 0 0 0 0 1 0 0 0 0 1 0 ) {\displaystyle {\begin{pmatrix}1&0&0&0\\\0&1&0&0\\\0&0&1&0\end{pmatrix}}} Matrices representing other geometric transformations can be combined with this and each other by matrix multiplication. As a result, any perspective projection of space can be represented as a single matrix.[21][22]

## Notes

[edit]

1. ^ August Ferdinand Möbius: Der barycentrische Calcul, Verlag von Johann Ambrosius Barth, Leipzig, 1827.
2. ^ O'Connor, John J.; Robertson, Edmund F., "August Ferdinand Möbius", MacTutor History of Mathematics Archive, University of St Andrews
3. ^ Smith, David Eugene (1906). History of Modern Mathematics. J. Wiley & Sons. p. 53.
4. ^ Igoe, Kevin; McGrew, David; Salter, Margaret (February 2011). "Fundamental Elliptic Curve Cryptography Algorithms".
5. ^ For the section: Jones 1912, pp. 120–122
6. ^ Woods 1922
7. ^ Garner 1981
8. ^ Miranda 1995
9. ^ Bôcher 1907, pp. 13–14
10. ^ Garner 1981, pp. 32–33
11. ^ For the section: Cox, Little & O'Shea 2007, pp. 360–362
12. ^ For the section: Miranda 1995, p. 14 and Jones 1912, p. 120
13. ^ Bôcher 1907, pp. 107–108 (adapted to the plane according to the footnote on p. 108)
14. ^ Woods 1922, pp. 2, 40
15. ^ Wilczynski 1906, p. 50
16. ^ Bôcher 1907, p. 110
17. ^ Jones 1912, p. 204
18. ^ Jones 1912, pp. 452 ff
19. ^ "Viewports and Clipping (Direct3D 9) (Windows)". msdn.microsoft.com. Retrieved 10 April 2018.
20. ^ Shreiner, Dave; Woo, Mason; Neider, Jackie; Davis, Tom; "OpenGL Programming Guide", 4th Edition, ISBN 978-0-321-17348-5, published December 2004. Page 38 and Appendix F (pp. 697-702) Discuss how OpenGL uses homogeneous coordinates in its rendering pipeline. Page 2 indicates that OpenGL is a software interface to graphics hardware.
21. ^ Mortenson, Michael E. (1999). Mathematics for Computer Graphics Applications. Industrial Press Inc. p. 318. ISBN 0-8311-3111-X.
22. ^ McConnell, Jeffrey J. (2006). Computer Graphics: Theory into Practice. Jones & Bartlett Learning. p. 120. ISBN 0-7637-2250-2.

## References

[edit]

* Bôcher, Maxime (1907). Introduction to Higher Algebra. Macmillan. pp. 11ff.
* Briot, Charles; Bouquet, Jean Claude (1896). Elements of Analytical Geometry of Two Dimensions. trans. J.H. Boyd. Werner school book company. p. 380.
* Cox, David A.; Little, John B.; O'Shea, Donal (2007). Ideals, Varieties, and Algorithms. Springer. p. 357\. ISBN 978-0-387-35650-1.
* Garner, Lynn E. (1981), An Outline of Projective Geometry, North Holland, ISBN 0-444-00423-8
* Jones, Alfred Clement (1912). An Introduction to Algebraical Geometry. Clarendon.
* Miranda, Rick (1995). Algebraic Curves and Riemann Surfaces. AMS Bookstore. p. 13\. ISBN 0-8218-0268-2.
* Wilczynski, Ernest Julius (1906). Projective Differential Geometry of Curves and Ruled Surfaces. B.G. Teubner.
* Woods, Frederick S. (1922). Higher Geometry. Ginn and Co. pp. 27ff.

## Further reading

[edit]

* Stillwell, John (2002). Mathematics and its History. Springer. pp. 134ff. ISBN 0-387-95336-1.

* Rogers, David F. (1976). Mathematical elements for computer graphics. McGraw Hill. ISBN 0070535272.

## External links

[edit]

Wikimedia Commons has media related to Projective geometry.

* Jules Bloomenthal and Jon Rokne, Homogeneous coordinates [1] Archived 2021-02-26 at the Wayback Machine
* Ching-Kuang Shene, Homogeneous coordinates [2]
* Wolfram MathWorld