Magnify a triangle with vertices, Computer Graphics

Assignment Help:

Magnify a triangle with vertices A = (1,1), B = (3,1) and C = (2,2) to twice its size in such a way that A remains in its original position. 

Answer: You need to apply scaling by keeping the point (1,1) fixed.  For this, you require following sequence of operations. 

(i) Translating the triangle so that (1,1)  is at the origin

(ii) Scaling the triangle by a factor of 2 in both the coordinates

(iii) Translating the triangle back so that A is back to (1,1). The sequence of transformation is as follows. 

1449_Magnify a triangle with vertices.png

The triangle is transformed to a triangle with vertices  (1,1), (5,1), (3,3).

 


Related Discussions:- Magnify a triangle with vertices

What is a blobby object, What is a Blobby object?  Some objects do not ...

What is a Blobby object?  Some objects do not handle a fixed shape, but change their surface characteristics in sure motions or when in proximity to other objects. That is call

Non trivial case of cohen sutherland line clippings, Non Trivial Case of co...

Non Trivial Case of cohen sutherland line clippings Case: assume for the line segment PQ, both the trivial rejection and acceptance tests failed (that is, Case 1 and Case 2

Determine the advantages of raster-scan systems, Determine the advantages o...

Determine the advantages of raster-scan systems (i)  Rasterisation is now performed faster since a special purpose processor is used. (ii)  The CPU is not slowed down by the

What is the need of homogeneous coordinates, What is the need of homogeneou...

What is the need of homogeneous coordinates?  To perform more than one transformation at a time, use homogeneous coordinates or matrixes. They decrease unwanted calculations in

Determine the steps uses in cohen sutherland line clipping, Steps uses in t...

Steps uses in the Cohen Sutherland Line Clipping Algorithm are: Figure: Steps for Cohen Sutherland Line Clipping STEP 1: Input:  x L , x R , y T , y B

De casteljau algorithm - 2d clipping algorithms, De Casteljau Algorithm ...

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.

Progressive scan in image capture formats, Progressive Scan: Progressive o...

Progressive Scan: Progressive or non-interlaced scanning is a process which displays, transmits or stores moving images wherein, the lines of all frame are drawn in order. It is i

Painting and drawing tools in multimedia, Painting and Drawing Tools Pa...

Painting and Drawing Tools Painting software is offered to producing crafted bitmapped images. Drawing software as Corel Draw and Canvas is offered to generating vector depend

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