Find out projection matrix for oblique projection, Computer Graphics

Assignment Help:

Find Out Projection Matrix for Oblique Projection

To find out projection matrix for oblique projection, we want to find out the direction vector d. Because vector PP' and vector d both contain the same direction. Hence, PP'=d 

 So, x'- 0=d1= f.cosθ

       y'- 0=d2= f.sinθ

       z'-1=d3

 Since z'=0 on the xy-plane, d3 = -1, 

Because, Oblique projection is a particular case of parallel projection, hence, we can transform the common transformation of parallel projection for Oblique projection as given:

792_Find Out Projection Matrix for Oblique Projection.png

Here, f=foreshortening factor, that is the projected length of the z-axis unit vector. When β is the angle among the Oblique projectors and the plane of projection so,

1/f=tan (β) , that is f= cot(β)

θ=angle among the projected line along with the positive x-axis.


Related Discussions:- Find out projection matrix for oblique projection

Visible surface detection - modeling and rendering , Visible Surface Detect...

Visible Surface Detection - Modeling and Rendering Provided a set of 3-Dimentional objects and a viewing position for the generation of realistic graphics show, we want to de

Line drawing algorithm, Adavantage and disadvantages of DDA and Bresenhams ...

Adavantage and disadvantages of DDA and Bresenhams line drawing algorithm

Shading , short note on shading

short note on shading

Reflection about a line - 2-d and 3-d transformations, Reflection about a L...

Reflection about a Line - 2-D and 3-D Transformations Reflection is a transformation that produces the mirror image of an object. Since we discussed that the mirror reflection

Horizontal retrace - hardware primitives, Horizontal Retrace - Hardware Pri...

Horizontal Retrace - Hardware Primitives Horizontal retrace refers to the time an electron beam takes to traverse a scan line.Vertical retrace means the time taken by the elect

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Various cases of cohen sutherland line clippings - algorithm, Various cases...

Various cases of Cohen Sutherland Line Clippings Currently, we study how this clipping algorithm works. For the sake of simplicity we will tackle all the cases with the assist

Principal vanishing point write respect to z-axis, Principal vanishing poin...

Principal vanishing point write respect to Z-axis Principal vanishing point w.r.t z-axis: By the 3rd row of matrix equation, we declare that the principal vanishing point w

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