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

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

Line generation algorithms - graphic primitives, Line Generation Algorithms...

Line Generation Algorithms - Graphic Primitives In previous section we have discussed the case of frame buffer, here information regarding the image to be projected upon the

Computer arthcther, How many 128 x 8 RAM chips are needed to provide a memo...

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?

Detailed explanation on mounting, QUESTION While the design and printin...

QUESTION While the design and printing of a job is of extreme importance, it is what happens to the job after it is printed that can really make it fantastic You have always

Potentially entering and leaving points - clipping, Potentially entering an...

Potentially entering and leaving points - P E and P L The intersection point of the line and window might be classified either like potentially leaving or entering. Before g

Line segment that joining by using bresenham line algorithm, Sketch Line Se...

Sketch Line Segment That Joining By Using Bresenham Line Algorithm Example: Sketch line segment that joining (20, 10) and (25, 14) by using Bresenham line generation algorit

Phong shading algorithm, Q. Describe briefly phong shading algorithm.   ...

Q. Describe briefly phong shading algorithm.   OR                Write short note on phong shading.    Phong shading   Phong shading or normal vector interpo

What will be the resulting rotation matrix, An object has to be rotated abo...

An object has to be rotated about an axis passing through the points (1,0 ,1), (1,3,1) .  What will be the resulting rotation matrix?    Solution: The axis is parallel to y axis

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

B splines, What is uniform rational splines

What is uniform rational splines

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