Important point for transformation for isometric projection, Computer Graphics

Assignment Help:

Important Points about the Transformation for isometric projection

Note: We can also verify such Isometric transformation matrix through checking all the foreshortening factors, that is, to check where all the foreshortening factors (fx, fy, fz) are equal or not. Identify the points A, B and C on the coordinate axes as in Figure.

1578_Important Point for Transformation for isometric projection.png

i)   Take OA, whether O=(0,0,0) and A (1,0,0). Assume that O is projected to O' and A is projected to A'.  Hence, by using equation, we have O'=(0,0,0) and A'=(2/3,-1/3,-1/3).

Consequently |O'A'| = √2/ 32 + (-1/3)2 + (-1/3)2 = √ 2/3 = fx

ii)  Take OB, here O = (0,0,0) and B (0,1,0). Assume here O is projected to O' and B is projected to B'. Hence by using equation, we cans say O'=(0,0,0) and B'= (-1/3,2/3,-1/3).

 Consequently |O'B'| =- √(1/3)2+ (2/3)2 + (-1/3)2 =√2 / 3 = fy

iii) Take OC, whether O=(0,0,0) and C(0,0,1). Assume here O is projected to O' and C is projected to C'. Hence, by using equation, we contain O'=(0,0,0) and C'=(-1/3,-1/3,2/3).

Consequently |O'C'|=√(-1/3)2 +(-1/3)2 +(2/3)2  = √2/3=fz

Hence, we have fx=fy=fz, that is true for Isometric projection.


Related Discussions:- Important point for transformation for isometric projection

Area subdivision method for hidden surface removal, Q.  Write a short note...

Q.  Write a short note on area subdivision method for hidden surface removal.   Ans. Area Subdivision This technique for hidden- surface removal is essentially an image- spac

Question, what are the steps involved in 3d transformation explain

what are the steps involved in 3d transformation explain

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

Scan line algorithm and seed fill algorithm, Scan line algorithm and seed f...

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Designing human Computer interface, I have an assignment to do & it''s due ...

I have an assignment to do & it''s due on Wednesday !

Sprite animation interactive may be non rectangular, Sprite animation inter...

Sprite animation interactive, may be non rectangular (Computer games) In its simplest form it is a 2-D graphic object which moves across the display. Sprites frequently can hav

Linking, Linking: A hypermedia system and also information in general cont...

Linking: A hypermedia system and also information in general contains different types of relationships among various information parts. Illustrations of typical relationships comp

Character generation, Which is the most usable and frequent method to gener...

Which is the most usable and frequent method to generate a character?

Frame, what is frame buffer

what is frame buffer

Removing polygons hidden through a surrounding polygon, Removing Polygons H...

Removing Polygons Hidden through a Surrounding Polygon: The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding

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