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

Architecture-applications for computer animation, Architecture: One of the...

Architecture: One of the purposes for the development of virtual reality (that is in fact a form of computer animation) was which it was going to be very helpful to architects. He

What is persistence and resolution, What is persistence and resolution?  ...

What is persistence and resolution?  The time it takes the emitted light from the screen to decay one tenth of its original intensity is known as a persistence.  The maximum

Graphic interchange format (gif), Graphic Interchange Format (GIF): The Gr...

Graphic Interchange Format (GIF): The Graphic Interchange Format is an efficient implies to transmit images across data networks. In the early 1990 year the original designers of

General perspective transformation with cop at the origin, General Perspect...

General Perspective transformation with COP at the origin Here we suppose the given point P(x,y,z) be projected like P'(x',y',z') on the plane of projection. The center of pro

Applications for computer animation-physics, Normal 0 false f...

Normal 0 false false false EN-US X-NONE X-NONE

Shading , short note on shading

short note on shading

Common principles of ray tracing, Common Principles of Ray Tracing Bas...

Common Principles of Ray Tracing Based upon the nature or attributes of the surface given by the user, the subsequent effects are implemented, as per to rules of optics:  a

What is fixed point scaling, What is fixed point scaling?  The location...

What is fixed point scaling?  The location of a scaled object can be controlled by a position known as the fixed point that is to remain unchanged after the scaling transformat

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

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