Acquire a transformation matrix for perspective projection, Computer Graphics

Assignment Help:

Acquire a transformation matrix for perspective projection for a specified object projected onto x=3 plane as viewed by (5,0,0).

Solution: Plane of projection: x = 3 as given. Here assume that P (x, y, z) be any point in the space. We identify the parametric equation of a line AB, beginning from A and passing   via B is like:

1111_Acquire a transformation matrix for perspective projection 1.png

Figure: (i)

P (t) = A + t. (B - A), o < t < ∞

Consequently parametric equation of a line starting from E (5,0,0) and also passing via P (x, y, z) becomes:

E + t (P - E), o < t < ∞

=  (5, 0, 0) + t [(x, y, z) - (5, 0, 0)]

= (5, 0, 0) + [t (x - 5), t. y, t. z]

= [t. (x - 5) + 5, t. y, t. z].

Suppose here Point P' is obtained, as t = t*

∴ P' = (x', y', z') = [t* (x - 5) + 5, t*y, t*. z]

Because, P' lies on x = 3 plane, consequently

t* (x - 5) + 5 = 3 should be actual;

t* = -2/(x - 5)

P' = (x',y',z') = (3,((-2.z)/(x-5)), ((-2.z)/(x-5)))

= ((3x-15)/(x- 5), (-2y)/(x - 5), (-2z)/(x - 5))

In Homogeneous coordinate system there is:

P' = (x', y', z', 1) = ((3x-15)/(x- 5), (-2y)/(x - 5), (-2z)/(x - 5), 1)

= (3x - 15, - 2.y, - 2.z, x - 5)                  --------------(1)

In Matrix form it will be:

341_Acquire a transformation matrix for perspective projection 2.png

------------------------------(2)

Hence, as in above equation (2) is the needed transformation matrix for perspective view from (5, 0, 0).


Related Discussions:- Acquire a transformation matrix for perspective projection

Vanishing point - viewing transformations, Vanishing Point - Viewing Transf...

Vanishing Point - Viewing Transformations This point is that point at those parallel lines shows to converge and vanish. A practical illustration is a long straight railroad

Sutherland cohen line clipping algorithm, Describe briefly Sutherland Cohen...

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Associative links, Associative Links: it is a link that is completely inde...

Associative Links: it is a link that is completely independent of the exact structure of the information. For illustration we have links depends on the meaning of various informat

Write a c code for generating concentric circles, Write a C code for genera...

Write a C code for generating concentric circles.  Put the circle function circleMidpoint()in a for loop  as follows: for( int radius = MinRadius; radius circleMidpoint(i

Briefly explain how the median filter works, QUESTION 1 (a) Write a run...

QUESTION 1 (a) Write a run method in Image J environment for the following cases Contrast and Brightness Histogram Generation Histogram Equalisation   (b)

Line drawing algorithm, when dda line drawing algorithm is more efficient t...

when dda line drawing algorithm is more efficient than bresenhem line drawing algorithm?

Animation, name some of the standard motion in key frames

name some of the standard motion in key frames

Whether cavalier projection is a parallel projection, State whether the fol...

State whether the following statements are true or false. Give reasons/examples to justify your answer.  a)  Cavalier projection is a parallel projection. b)  Angles are not

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