Transformation for 3-d scaling, Computer Graphics

Assignment Help:

Transformation for 3-D Scaling

As we already seen that the scaling process is mainly utilized to change the size of an object. The scale factors find out whether the scaling is a magnification as s>1 or a reduction, s<1. 2-dimensional scaling, is in equation (8), can be simply extended to scaling in 3-dimensional case by consisting the z-dimension.

For any point (x,y,z), we move in (x.sx,y.sy,z.sz), here sx, sy, and sz are the scaling factors in the x,y, and z-directions correspondingly.

Hence, scaling w.r.t. origin is given by:

Ssx,sy,sz =    x'= x.sx

         y'= y.sy                                                  

z'= z.sz

In matrix form:

1186_Transformation for 3-D Scaling 1.png

In terms of Homogeneous coordinate system, above equation is written as:

1834_Transformation for 3-D Scaling 2.png

As, P'=P. Ssx,sy,sz


Related Discussions:- Transformation for 3-d scaling

Production of animation , Historical and traditional methods for productio...

Historical and traditional methods for production of animation                                              Definition: Computer animation is a time depends phenome

Overstriking, why overstriking is harmful.justify

why overstriking is harmful.justify

Introduction of 2-d and 3-d transformations, Introduction of 2-D and 3-D  ...

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 transla

Rotation - 2-d and 3-d transformations, Rotation - 2-d and 3-d transformati...

Rotation - 2-d and 3-d transformations Given a 2-D point P(x,y), that we want to rotate, along with respect to an arbitrary point A(h,k). Suppose P'(x'y') be the effect of ant

Various ways of simulating motion, Various ways of simulating motion:- ...

Various ways of simulating motion:- -        Zero Acceleration (Constant Speed)           -        Non-Zero Accelerations -        Positive accelerations

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

Scan-line method, In contrast to depth-buffer method, here we identify one ...

In contrast to depth-buffer method, here we identify one surface at one time, scan-line method deals along with multiple surfaces. Since it processes each scan-line at one time, al

Input and hardcopy devices - 2d shape primitives, Input and Hardcopy Device...

Input and Hardcopy Devices  This section gives a brief introduction to the functioning of some well known input and hardcopy devices. Input devices include keyboard, mouse, sca

Orientation dependence - modeling and rendering, Orientation Dependence - M...

Orientation Dependence - Modeling and Rendering The outcomes of interpolated-shading models are dependent of the projected polygon's orientation. Because values are interpolat

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

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