General perspective transformation, Computer Graphics

Assignment Help:

General Perspective transformation w.r.t. an arbitrary center of projection

Suppose here that the COP is at C(a,b,c), as demonstrated in Figure.

By Figure, the vectors CP and CP' have the simila direction. The vector CP' is a factor of CP, which is CP'=α. CP

Hence, (x'-a)= α.(x-a)                                  z

(y'-b)= α.(y-b)

(z'-c)= α.(z-c)

1163_General Perspective Transformation.png

We know about the projection plane passing via a reference point R0(x0,y0,z0) and consisting a normal vector N= n1I+n2J+n3K, satisfies the subsequent equation:

n1.(x-x0)+n2.(y-y0)+n3.(z-z0)=0

When P'(x',y',z') lies upon this plane then we have:

n1.(x'-x0)+n2.(y'-y0)+n3.(z'-z0)=0

now substitute the value of x', y' and z' then we have:

α= (n1.(x0-a)+n2.(y0-b)+n3.(z0-c))/( n1.(x-a)+n2.(y-b)+n3.(z-c))

=((n1.x0+n2.y0+n3.z0)-(n1.a+n2.b+n3.c))/(n1.(x-a)+n2.(y-b)+n3.(z-c))

=(d0-d1)/(n1.(x-a)+n2.(y-b)+n3.(z-c))

=d/(n1.(x-a)+n2.(y-b)+n3.(z-c))

Currently,  d=d0-d1=  (n1.x0+n2.y0+n3.z0) - (n1.a+n2.b+n3.c)  shows  perpendicular distance from center of projection, C to the projection plane.

In order to determine the general perspective transformation matrix so we have to proceed as given here:

Translate COP, C (a, b, c) to the origin.  Now, R'0=(x0-a, y0-b, z0-c) turn sinto the reference point of the translated plane which is normal vector will remain similar.

By applying the general perspective transformation as Pper,N,R'o

Now translate the origin back to C as.

116_General Perspective Transformation 2.png

Here d = N.CR' 0 = d0 - d1 = (n1. x0 + n2. Y0 + n3.z0) - (n1.a+n2.b +n3.c)

= n1. (x0 - a) + n2. (y0 - b) + n3. (z0 - c)

And also d1 = n1.a + n2.b + n3.c


Related Discussions:- General perspective transformation

Digital video, Digital Video: Digital video is a form of video record...

Digital Video: Digital video is a form of video recording system which works through using a digital, quite than analog, representation of the video signal. It generic means,

What is rotation, What is rotation?  A 2-D rotation is completed by rep...

What is rotation?  A 2-D rotation is completed by repositioning the coordinates with a circular path, in the x-y plane by making an angle with the axes. The transformation is g

Transformation for 3-d shearing, Transformation for 3-D Shearing 2-dim...

Transformation for 3-D Shearing 2-dimensional xy-shearing transformation, as explained in equation, can also be simply extended to 3-dimensional case. All coordinates are tran

Calculate the gray level value for all the pixels, An 8x8 image f[i,j] has ...

An 8x8 image f[i,j] has gray levels given by the following equation: f [i , j]= ? i-j ? ; i,j=0,1,2,3,4,5,6,7. a. Calculate the gray level value for all the pixels in the 8x8

Define computer graphics, Define Computer graphics.  Computer graphics ...

Define Computer graphics.  Computer graphics remains one of the most popular and rapidly growing computer fields. Computer graphics may be explained as a pictorial representati

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

Translation - 2-d and 3-d transformations, Translation - 2-d and 3-d Transf...

Translation - 2-d and 3-d Transformations It is the process of changing the position of an object. Suppose an object point P(x,y)=xI+yJ be moved to P'(x',y') by the specified

Important points about the curve segment, Important Points about the Curve ...

Important Points about the Curve segment - properties of bezier curves Note : if P (u) → = Bezier curve of sequence n and Q (u) → Bezier curve of sequence m. After that Co

Forensics-applications for computer animation, Forensics: Accidents occur ...

Forensics: Accidents occur every minute. Very frequently, there are no witnesses except for the individuals concerned in the accident or worse yet, there are no surviving witnesse

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.

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