Carry out a perspective projection, Computer Graphics

Assignment Help:

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; here the eye is placed at (10, 0,10).

Solution: Suppose here that P (x, y, z) be any point in the space.

The parametric equation of a line beginning from E and passing via P is: E + t. (P - E), o < t < 1.

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

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

= (t. (x - 10) + 10, t. y, t (z - 10) + 10)

Suppose a point P' can be obtained, as t = t*

∴P' = (x', y', z') = (t* (x - 10) + 10, t*.y, t*. (z - 10) + 10)

 Because the point P' lies on x = 0 plane as:

1898_Carry out a perspective projection 1.png

          Figure: (j)

= t* (x - 10) + 10 = 0

= t* =(- 10)/ (x - 10)

= P' = (x',y',z') = (0,((-10.y)/(x - 10)),(((-10)(z - 10))/(x - 10)), + 10)

(0, ((-10.y)/(x - 10)),((10x - 10z)/(x - 10)))

In terms of Homogeneous coordinate system;

P' = (x', y', z', 1) = ( 0, ((-y )/((x - 10) - 1)) ,  (x -z)/((x/10) - 1)), 1)

= (0, -y, x-z, ((x/10) - 1))

In Matrix form there is:

2067_Carry out a perspective projection 2.png

-------------------------(1)

In above equation (1) is the needed perspective transformation, that gives a coordinates of a projected point P' (x', y', z') on the x = 0 plane, whereas a point p (x, y, z) is viewed from E (10, 0, 10)

Currently, for the specified points A (-5, 4, 2) and B (5, -6, 18), A' and B' are their projection upon the x = 0 plane.

So now from Equation (1) we get:

1289_Carry out a perspective projection 3.png

= (0,-4, -7, ((-5/10) - 1))

= (0 , -40, -70, -15)

(0, 40/15, 70/15, 1)

Thus x1' = 0;  y1' = 2.67 ;    z1' = 4.67

As the same in:

137_Carry out a perspective projection 4..png

= (0, 60, - 130, - 5)

= (0, - 12, 26, 1)

 Thus x2' = 0 ;  y2' = - 12 ;    z2' = 26

Hence the projected points A' and B' of specified points A and B are:

A' = (x1', y1'z1') = (0, 2.67, 4.67)    and     B' = (x2', y2', z2') = (0, - 12, 26, 1)


Related Discussions:- Carry out a perspective projection

Multimedia-applications for computer animation, Multimedia: it is the use ...

Multimedia: it is the use of different media to present a specific subject. This representation itself is a multimedia presentation implies; it brings together text and graphics.

What is fixed point scaling, What is fixed point scaling?  The location...

What is fixed point scaling?  The location of a scaled object can be controlled by a position known as the fixed point that is to remain unchanged after the scaling transformat

Detecting skin in colour images, In this lab you will learn how to use chro...

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

What is persistence, What is persistence? The time it takes the emitted...

What is persistence? The time it takes the emitted light from the screen to decompose one tenth of its original intensity is known as persistence.

Applications for computer animation, Applications For Computer Animation ...

Applications For Computer Animation These days, animation influences approximately every aspect of life right from entertainment to education and to security and lots of more a

3d studio max -softwares for computer animation, 3DStudio Max -Softwares fo...

3DStudio Max -Softwares for computer animation The successor to 3-DStudio 3.0, 3-DStudio Max runs in WindowsNT. This is completely object-oriented, featuring new enhancements a

Time delay and busy flag method, 1. Using a time Delay Method The delay...

1. Using a time Delay Method The delay required between issuing each character to the LCD is about 5-10ms (it's simply known as DELAY). When programming an LCD, a long delay is

Deffrent, deffrent between vecgen algorithm and bresenham line algorithm in...

deffrent between vecgen algorithm and bresenham line algorithm in computer graphic

Line clipping algorithm - cohen sutherland algorithm, Line Clipping Algorit...

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

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