Homogeneous coordinate systems - 2-d and 3-d transformations, Computer Graphics

Homogeneous Coordinate Systems - 2-d and 3-d transformations

Suppose P(x,y) be any point in 2-D Euclidean (Cartesian) system. In HC System, we add a third coordinate to a point. In place of (x,y), all points are represented via a triple (x,y,H) where H≠0;  along with the condition which is (x1,y1,H1)=(x2,y2,H2) ↔ x1/H1 = x2/H2 ; y1/H1 = y2/H2.

Currently, if we take H=0, then we contain point at infinity, that is, generation of horizons.

Hence, (2, 3, 6) and (4, 6, 12) are the similar points are represented by various coordinate triples, that is each point has many diverse Homogeneous Coordinate representation.

2-D Euclidian System                    Homogeneous Coordinate System

Any point (x,y)                                  (x,y,1)


If (x,y,H) be any point in HCS(such that H≠0); Then (x,y,H)=(x/H,y/H,1)

(x/H,y/H)                          (x,y,H)

Currently, we are in the position to build the matrix form for the translation along with the utilization of homogeneous coordinates.For translation transformation (x,y)→(x+tx,y+ty) within Euclidian system, here tx and ty both are the translation factor in direction of x and y respectively. Unfortunately, this manner of illustrating translation does not utilize a matrix; consequently it cannot be combined along with other transformations by easy matrix multiplication. That type of combination would be desirable; for illustration, we have observed that rotation about an arbitrary point can be done via a rotation, a translation and the other translation. We would like to be capable to combine these three transformations in a particular transformation for the sake of elegance and efficiency. One way of doing such, is to utilize homogeneous coordinates. In homogeneous coordinates we utilize 3x3 matrices in place of 2x2, initiating an additional dummy coordinate H. In place of (x,y), each point is demonstrated by a triple (x,y,H) here H≠0; In two dimensions the value of H is generally set at 1 for simplicity.

Hence, in homogeneous coordinate systems (x,y,1) → (x+tx,y+ty,1), now, we can simplifies this in matrix form like:

1389_Homogeneous Coordinate Systems - 2-d and 3-d transformations.png

Posted Date: 4/3/2013 5:55:16 AM | Location : United States

Related Discussions:- Homogeneous coordinate systems - 2-d and 3-d transformations, Assignment Help, Ask Question on Homogeneous coordinate systems - 2-d and 3-d transformations, Get Answer, Expert's Help, Homogeneous coordinate systems - 2-d and 3-d transformations Discussions

Write discussion on Homogeneous coordinate systems - 2-d and 3-d transformations
Your posts are moderated
Related Questions
(a) Differentiate between the following compression algorithm: 1. Shannon -Fano Algorithm and 2. Huffman Encoding (b) A statistical encoding algorithm is being considered

Flash - software to generate computer animations Flash: Learning Macro-Media's Flash can quite complicated, although you can do almost anything along with it. You can devel

What is homogeneous coordinate? Discuss the composite transformation matrix for two successive translations and scaling. In design and picture formation process, many times

Delta-Delta Arrangement and In-Line Arrangement There are two types of shadow masks available, delta-delta arrangement and in-line arrangement. The in-line arrangement refers t

Area subdivision Method - Visible Surface Detection What are the circumstances to be fulfilled, in Area-subdivision method, thus a surface not to be divided in addition? S

Anti Aliasing - Modeling and Rendering It is a method for enhancing the realism of an image through eliminating the jagged edges from it. Such jagged edges or "jaggies", appe

Question 1) Encode the following string using HUFFMAN ENCODING:                            DO YOU LIKE TINKY WINKY OR EMPTY DUMPTY?     Empty spaces are considered.


Projections When all display devices are 2D, you need to devise methods that give a realistic view of a 3D scene onto 2D display. With more and more devices coming in the marke

Implement Cohen Sutherland and Liang Barsky line clipping algorithms in C-language.  Test your code for line segments with end points falling in various regions.