Introduction of 2-d and 3-d transformations, Computer Graphics

Introduction of 2-D and 3-D  Transformations

In this, the subsequent things have been discussed in detail as given below:

  • Different geometric transformations as translation, scaling, reflection, shearing and rotation.
  • Translation, Reflection and Rotation transformations are utilized to manipulate the specified object, where Shearing and Scaling both transformation changes their sizes.
  • Translation is the process of altering the position but not the shape/size, of an object with respect to the origin of the coordinate axes.
  • In 2-D rotation, an object is rotated via an angle θ. There are two cases of 2-Dimentional rotation: case1- rotation regarding to the origin and case2- rotation regarding to an arbitrary point. Consequently, in 2-D, a rotation is prescribed by an angle of rotation θ and a centre of rotation, as P. Conversely, in 3-D rotations, we require to mention the angle of rotation and the axis of rotation.
  • Scaling process is mostly utilized to change the shape or size of an object. The scale factors find out whether the scaling is a magnification, s>1 or a reduction as s<1.
  • Shearing transformation is a particular case of translation. The consequence of this transformation looks like "pushing" a geometric object in a direction which is parallel to a coordinate plane as 3D or a coordinate axis as 2D. How far a direction is pushed is found by its shearing factor.
  • Reflection is a transformation that generates the mirror image of an object. For reflection we require to know the reference axis or reference plane depending upon where the object is 2-D or 3-D.
  • Composite transformation engages more than one transformation concatenated in a particular matrix. Such process is also termed as concatenation of matrices. Any transformation made about an arbitrary point makes use of composite transformation as Rotation regarding to an arbitrary point, reflection regarding to an arbitrary line, and so on.
  • The utilization of homogeneous coordinate system to shows the translation transformation into matrix form, enlarges our N-coordinate system along with (N+1) coordinate system.
Posted Date: 4/3/2013 6:14:51 AM | Location : United States

Related Discussions:- Introduction of 2-d and 3-d transformations, Assignment Help, Ask Question on Introduction of 2-d and 3-d transformations, Get Answer, Expert's Help, Introduction of 2-d and 3-d transformations Discussions

Write discussion on Introduction of 2-d and 3-d transformations
Your posts are moderated
Related Questions
For this assignment, you will add to the drawing program new features that are similar to features that you already have. Apply object-oriented design concepts such as inheritance

Multimedia Tool Features General to nearly all multimedia tool platforms are various features for encapsulating the content, presenting the data, acquiring user input and cont

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

Intersection Test - Visible Surface Detection Test: It called Intersection Test also: we go for intersection test, if Min-max test fails. Now we take each edge individually

Web Design and Editing To edit and make a website, the big three softwares are use: 1)   DreamWeaver (MacroMedia) 2)   Frontpage (MicroSoft) 3)   Go Live (Adobe) 4)

Rotation about an arbitrary axis Rotation about an arbitrary axis is a composition of several rotations and translation operations. What you need to do is the following:  a)

The table as given below demonstrates possible values of such parameters for classic applications of digital video. Application                  Frame rate                  Dime

differentiate between dda and bresenhams line algorithm

Notes for Specular reflection (1) In addition to diffuse reflection, light sources produce highlights or bright spots termed as specular reflection. Such highlighting is extre

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000