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

Application of sutherland hodgman polygon clipping, For good understanding ...

For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon. Fi

Dda, what is dda

what is dda

State the technology used in lcd, State the technology used in LCD Some...

State the technology used in LCD Some passive matrix (Pixels are illuminated in scanline order like a raster display but  the lack of phospherescence causes flicker) LCDs have

Determine the term- virtual reality, Determine the term- Virtual Reality ...

Determine the term- Virtual Reality Virtual Reality (VR) This is an artificial 3D environment which is created by a computer system. Very often user wears data helmet, d

Mathematical description of oblique projection onto xy-plane, Mathematical ...

Mathematical description of an Oblique projection onto xy-plane  In order to expand the transformation for the oblique projection, identify the Figure. This figure explains a

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

Boundary-fill algorithm or flood-fill algorithm , boundary-fill algorithm o...

boundary-fill algorithm or flood-fill algorithm As you saw the implementation of scan line polygon fill requires that boundaries should be straight line segments.  The seed fi

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Illustration of a clipping window - raster graphics, Illustration of a Clip...

Illustration of a Clipping window ABCD is placed as follows: A (100, 10), B (160, 10, C (160, 40), D (100, 40) By using Sutherland-Cohen clipping algorithm determine the vis

Modify the dda algorithm for negative sloped lines, 1. Modify the DDA algo...

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0   Ans. For the generation of lines along with negative slopes as:

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