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

Positioning Techniques, Explain Positioning Techniques in computer Graphics...

Explain Positioning Techniques in computer Graphics in detail

What are the advantages of electrostatic plotters, What are the advantages ...

What are the advantages of electrostatic plotters?  They are faster than pen plotters and very high quality printers. Recent electrostatic plotters contain a scan-conv

Panning and zooning, what is zooming and panning in computer graph please e...

what is zooming and panning in computer graph please explan??

Detecting skin in colour images, In this lab you will learn how to use chro...

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in im

Dv encoder type 1, DV Encoder Type 1 : The video and audio streams are tog...

DV Encoder Type 1 : The video and audio streams are together interfaces by standard DV bit stream. Such format is fully supported through DirectShow which accepts this interleaved

Handling mouse input, When you set up your project, create the class as an ...

When you set up your project, create the class as an "ACM Graphics Program", rather than a plain class. This will perform the necessary preparations for you to use mouse input in y

Explain the bresenham line generation algorithm, 1. Explain the Bresenham ...

1. Explain the Bresenham line generation algorithm via digitizing the line with end  points as (15, 5) and also (25,13). Ans. Now we are utilizing the Bresenham line generati

Buffer areas required for z-buffer algorithm, Buffer Areas Required For Z-B...

Buffer Areas Required For Z-Buffer Algorithm For applying z-buffer algorithm, we need two buffer areas or two 2-Dimentional arrays: 1) Depth-buffer [i,j], to sa

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