Relation between 2-d euclidean system and homogeneous system, Computer Graphics

Assignment Help:

Relation between 2-D Euclidean system and Homogeneous coordinate system

Suppose that P(x,y) be any point in 2-D Euclidean system. In HCS, we add a third coordinate to the point. In place of (x,y), all points are represented via a triple (x,y,H) so H≠0; along with the condition as (x1,y1,H1)=(x2,y2,H2) ↔ x1/H1 = x2/H2 ; y1/H1 = y2/H2. In two dimensions the value of H is generally remained at 1 for simplicity. If we take H=0 now, then this presents point at infinity, which is generation of horizons.

The subsequent table demonstrates an association between 2-D Euclidean (Cartesian coordinate) system and Homogeneous coordinate system.

2-D Euclidian System                                        Homogeneous Coordinate System (HCS)

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), which is

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

Any one point (x,y) → (x+tx,y+ty) in 2-D Euclidian system. By using Homogeneous coordinate system, this translation transformation can be presented as (x,y,1) → (x+tx,y+ty,1). In two dimensions the value of H is generally maintained at 1 for simplicity. Here, we are capable to represent this translation transformation in matrix form as:

242_Relation between 2-D Euclidean (Cartesian) system and Homogeneous coordinate system 2.png

 (x',y',1)=(x,y,1)

P'h=Ph.Tv    

Here P'h and Ph   demonstrate here object points in Homogeneous Coordinates and Tv is termed as homogeneous transformation matrix for translation. Consequently, P'h, the new coordinates of a transformed object, can be determined by multiplying earlier object coordinate matrix, Ph, along with the transformation matrix for translation Tv.

The benefit of initiating the matrix form of translation is to simplify the operations on complicated objects which are, we can now build complicated transformations by multiplying the basic matrix transformations. Such process is termed as concatenation of matrices and the resulting matrix is frequently referred as the composite transformation matrix.


Related Discussions:- Relation between 2-d euclidean system and homogeneous system

Hypertext/media and human memory, Hypertext/media and Human Memory Huma...

Hypertext/media and Human Memory Humans associate pieces of information along with other information and make complicated knowledge structures. Thus, this is also said as the h

How is sampling done, Image Processing 1. How is sampling done? Explain...

Image Processing 1. How is sampling done? Explain quantization in digital image processing? 2. Explain in brief: (1) Image Subtraction (ii) Image averaging. 3. Explain in

Given two triangles p along with vertices as p1(100, Given two triangles P ...

Given two triangles P along with vertices as P1(100,100,50), P2(50,50,50), P3(150,50,50) and q along with vertices as Q1(40,80,60), q2(70,70,50), Q3( 10,75,70), determine that tria

Explain about unified memory architecture, Q. Explain about Unified Memory ...

Q. Explain about Unified Memory Architecture? UMA signifies Unified Memory Architecture. It is an architecture that reduces the cost of PC construction.  In this a part of main

Plasma panel - raster graphics and clipping, Plasma Panel - Raster Graphics...

Plasma Panel - Raster Graphics and Clipping This is an inherent memory device. Images can be written into the surface point by point and they keep stable, without flicked for

Refresh buffer, what is refresh buffer/ identify the content and organisati...

what is refresh buffer/ identify the content and organisation of the refresh buffer for the case of raster display and vector display.

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

Find out the matrix of projection, Find out the matrix of projection for ca...

Find out the matrix of projection for cavalier projection Answer: Cavalier projection corresponds to tan α = 1, leading to the following matrix.

Determine the steps uses in cohen sutherland line clipping, Steps uses in t...

Steps uses in the Cohen Sutherland Line Clipping Algorithm are: Figure: Steps for Cohen Sutherland Line Clipping STEP 1: Input:  x L , x R , y T , y B

What is run length encoding, What is run length encoding?   Run length ...

What is run length encoding?   Run length encoding is a compression method used to store the intensity values in the frame buffer, which keeps each scan line as a set of intege

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