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

Assignment Help:

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.

Related Discussions:- Introduction of 2-d and 3-d transformations

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

Oblique projection, find the transformation and draw the cube for cavalier...

find the transformation and draw the cube for cavalier and cabinet with theta = 37 degree

Categories of orthographic projection, Categories of Orthographic Projectio...

Categories of Orthographic Projection Orthographic projection is additionally divided into Multi-view projection and axonometric projection, depending upon where the direction

2d shape primitives, 2D Shape Primitives You have already learnt to plo...

2D Shape Primitives You have already learnt to plot a point or a pixel on any display device. In this unit, we shall introduce you to various devices available for data input o

Subdivision algorithm - visible surface detection, Subdivision Algorithm - ...

Subdivision Algorithm - Visible Surface Detection 1) Initialize the area to be the whole screen. 2) Create a PVPL regarding an area, sorted on z min as the smallest z coor

Picture information - raster graphics and clipping, Picture Information - ...

Picture Information - Raster Graphics and  Clipping Now, the picture information is accumulated in the form of bit plans on which all bit plane complete information of pictur

How does resolution of a system influence graphic display, 1. How does the...

1. How does the resolution of a system influence graphic display? Ans. In a high resolution system the adjacent pixels are so near spaced such approximated line-pixels lie extr

Midpoint circle algorithm for scan converting a circle, Explain Bresenham s...

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle

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

What is jpeg, Question 1 What is JPEG? How do you change the quality of a ...

Question 1 What is JPEG? How do you change the quality of a JPEG image? Question 2 What are the advantages and challenges of virtual classroom? Question 3 What do

Write Your Message!

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