3-d transformation, Computer Graphics

Assignment Help:

3-D Transformation

The capability to represent or display a three-dimensional object is basically to the knowing of the shape of that object. Moreover, the capability to rotate, translate and also project views of such object is also, in various cases, basically to the understanding of its shape. Manipulation, construction and viewing of 3-dimensional graphic images need the utilization of coordinate transformations and 3-dimensional geometric. Within geometric transformation, the coordinate system is set and the desired transformation of the object is finished w.r.t. the coordinate system. During coordinate transformation, the object is fixed and the preferred transformation of the object is complete on the coordinate system itself. Such transformations are formed via composing the essential transformations of translation, rotation and scaling. All of these transformations can be demonstrated as a matrix transformation. It permits more complex transformations to be constructed by utilization of matrix concatenation or multiplication. We can make the complicated objects/pictures, via immediate transformations. In order to demonstrate all these transformations, we require utilizing homogeneous coordinates.

Thus, if P(x,y,z) be any point in 3-dimensional space then in Homogeneous coordinate system, we add a fourth-coordinate to a point. It is in place of (x,y,z), all points can be represented via a Quadruple (x,y,z,H), where H≠0; along with the condition is x1/H1=x2/H2; y1/H1=y2/H2; z1/H1=z2/H2. For two points (x1, y1, z1, H1) = (x2, y2, z2, H2) ; such that H1 ≠ 0, H2 ≠ 0. Hence any point (x,y,z) in Cartesian system can be illustrated by a four-dimensional vector like (x,y,z,1) in HCS. Similarly, if (x,y,z,H) be any point in Homogeneous coordinate system then (x/H,y/H,z/H) be the equivalent point in Cartesian system. Hence, a point in 3-dimensional space (x,y,z) can be demonstrated by a four-dimensional point as: (x',y',z',1)=(x,y,z,1).[T], here [T] is several transformation matrix and (x',y'z',1) is a new coordinate of a specified point (x,y,z,1), so after the transformation.

The completed 4x4 transformation matrix for 3-dimensional homogeneous coordinates as:

2350_3-D Transformation.png

The upper left (3x3) sub matrix generates scaling, reflection, rotation and shearing transformation. The lower left (1x3) sub-matrix generates translation and the upper right (3x1) sub-matrix produces a perspective transformation that we will study in the subsequent section. The final lower right-hand (1x1) sub-matrix generates overall scaling.


Related Discussions:- 3-d transformation

Intensity of colours - raster graphics and clipping, Similarly we can contr...

Similarly we can control the intensity of colours We contain more bit planes for all colour say three bit planes for R, 3 for G and 3 for B here all bit plane of size mxn, hen

Explain the term- control, Explain the term- Control Traffic lights (co...

Explain the term- Control Traffic lights (controlling the sequence of lights to maintain optimum traffic flow), chemical and nuclear plants (opening and closing valves, safety

Shannon fano with the lempel ziv welsh algorithm, Question: (a) A stat...

Question: (a) A statistical encoding algorithm is being considered for the transmission of a large number of long text files over a public network. Part of the file content i

Types of formats of audio file formats, Types of Formats It is signific...

Types of Formats It is significant to distinguish among a file format and a codec. Although most audio file formats support merely one audio codec, a file format may assist mul

Ellipse generation algorithm - 2d shape primitives, Ellipse Generation Algo...

Ellipse Generation Algorithm  You know that a circle is symmetric in all the octants, while ellipse is symmetric with respect to four quadrants.  Therefore, to draw an ellipse,

Write a c code for generating concentric circles, Write a C code for genera...

Write a C code for generating concentric circles.  Put the circle function circleMidpoint()in a for loop  as follows: for( int radius = MinRadius; radius circleMidpoint(i

Curve segment - properties of bezier curves, Curve segment - properties of ...

Curve segment - properties of bezier curves Note : 1) The joining point on the curve along w.r.t. the parameter based upon second derivates of Q(t) is the acceleration. Wh

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