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

Assignment Help:

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


Related Discussions:- Homogeneous coordinate systems - 2-d and 3-d transformations

Description of the particularities of each drawing style, Question: (a)...

Question: (a) There are 3 main industries of drawing style and it has become a phenomenon. It was inspired by internationally diffused cartoons, comic strip books and since the

List out the merits and demerits of dvst, List out the merits and demerits ...

List out the merits and demerits of DVST?  The merits and demerits of direct view storage tubes [DVST] are as follows  It has a flat screen Refreshing of screen is

What is reflection and clipping, What is reflection and clipping? The r...

What is reflection and clipping? The reflection is actually the transformation that makes a mirror image of an object. For this use some angles and lines of reflection.  Cli

Gourand shading, what is ray tracing algorithm in hidden surface removal

what is ray tracing algorithm in hidden surface removal

Design and functioning of a refresh cathode ray tube, Design and functionin...

Design and functioning of a refresh cathode ray tube Primary components of refresh cathode ray tube are (i) electron gun used in producing electron beam (ii) heating fila

Polygon surfaces - curves and surfaces, Polygon Surfaces - Curves and Surfa...

Polygon Surfaces - Curves and Surfaces   By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i

Containment test - visible surface detection, Containment Test -  visible s...

Containment Test -  visible surface detection Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. The

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Image classification, The image classification is the process to categorize...

The image classification is the process to categorize images into one of several classes or categories. In this project, there are seven categories (Piano, Kangaroo, Strawberry, Su

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd