3-d transformation, Computer Graphics

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.

Posted Date: 4/3/2013 5:59:52 AM | Location : United States







Related Discussions:- 3-d transformation, Assignment Help, Ask Question on 3-d transformation, Get Answer, Expert's Help, 3-d transformation Discussions

Write discussion on 3-d transformation
Your posts are moderated
Related Questions
Polygon representation methods - Boundary representations Boundary representations: now the 3-D object is shown as a set of surfaces which separate the object interior from

Curves and Surfaces - Modeling   and Rendering We have studied the method of drawing curves in diverse coordinate systems. Also we got the concept that it is the revolution of

Midpoint Circle Generation Algorithm   Just as a line drawing algorithm approximates infinite number of points on a line segment by only a finite number of pixels, a circle dra

Persistence: How long they continue to emit light (that is, have excited electrons returning to the ground state) after the CRT beam is removed. Persistence is defined as the ti

Explain application areas of computer graphics in different areas.    Early computer graphics has only certain special capabilities such as straight lines circles and ellipses

Reflection and Shear There are a few important transformations which are not primitive in the sense that they can be expressed as compositions of translation, rotation and scal

View Volumes and General Projection Transformations You have to remember that the view volume is the volume which sets up near and far extents, top and bottom extents and left

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.

The purpose of this assignment is for you to create an animation like you would see on an electronic greeting card. Have fun and be creative.  Here are the requirements: you

Assumptions for Polygon or Area Clipping Algorithm Assumption: The viewport and window are rectangular. So only, by identifying the maximum and the minimum coordinates t