Transformation for 3-d scaling, Computer Graphics

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

Posted Date: 4/3/2013 6:11:20 AM | Location : United States







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

Write discussion on Transformation for 3-d scaling
Your posts are moderated
Related Questions
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


explainapplication of coherence in visible surface detection method

Simulating Accelerations - Computer Animation In previous block, we have seen the dominance and function of mathematics in computer graphics and now, we will undertake the invo

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in im

why overstriking is harmful.justify

Question: (a) In computer graphics it is important to distinguish between the two approaches to graphical modeling:vector graphics and raster graphics. Explain in details th

Consider the line segment AB in 3-Dimentional parallel to the z-axis along with end points A (- 5,4,2) and also B (5,-6,18). Carry out a perspective projection upon the X=0 plane;

Cohen Sutherland algorithm Point clipping is very simple.  All you need to check is whether a point is inside the window extremes in x- and y-directions.  For line clipping sev

What is vanishing point and view reference point? The perspective projections of any set of parallel lines that are not parallel to the projection plane converge to appoint cal