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

General perspective transformation, General Perspective transformation w.r....

General Perspective transformation w.r.t. an arbitrary center of projection Suppose here that the COP is at C(a,b,c), as demonstrated in Figure. By Figure, the vectors CP

What is scan line algorithm, What is scan line algorithm?  One way to f...

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

Definition of computer animation, Definition of Computer Animation A ti...

Definition of Computer Animation A time dependence phenomenon for imparting visual modifies in any scene as per to any time sequence, the visual modifies could be incorporated

What is polygon mesh, What is Polygon mesh?  Polygon mesh is a method t...

What is Polygon mesh?  Polygon mesh is a method to show the polygon, when the object surfaces are tiled, it is more convenient to state the surface facets with a mesh function.

digital audio technologies, Digital audio technologies DAB (Digita...

Digital audio technologies DAB (Digital Audio Broadcasting) Digital Audio Tape (DAT) DVD DVD-A Digital audio player Compact disc (CD) Minidisc (obsolete

Scan conversion, what are the advertising effects of scan conversion

what are the advertising effects of scan conversion

Ray tracing algorithm, Ray Tracing:  Ray t racing is the technique to dete...

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the

Scan line polygon fill and seed fill or flood fill algorithm, 1.   Distingu...

1.   Distinguish among Scan line polygon fill and Seed fill or Flood fill algorithm? Scan Line Polygon Flood Fill Algorithms ?1. This

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