Transformation for 3-d translation, Computer Graphics

Assignment Help:

Suppose P be the point object along with the coordinate (x,y,z). We want to translate such object point to the new position as, P'(x',y',z') through the translation Vector as V=tx.I+ty.J+tz.K , here tx , ty and tz  are the translation factor into the x, y, and z directions correspondingly, as demonstrated in Figure 8. It is, a point (x,y,z) is shifted to (x+ tx,y+ ty,z+ tz). Hence the new coordinates of a point can be written:

819_Transformation for 3-D Translation 1.png

In terms of homogeneous coordinates, above equation  becomes:

That is: P'h = Ph.Tv

1443_Transformation for 3-D Translation 2.png

 


Related Discussions:- Transformation for 3-d translation

High level techniques (motion generalized), High level techniques (motion g...

High level techniques (motion generalized) Techniques utilized to explain general motion behavior of any of graphic object, such techniques are algorithms or models utilized to

Ray tracing algorithm, Ray Tracing:  Ray t racing is the technique to dete...

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the

Role in education and training, Role in Education and Training:- A multime...

Role in Education and Training:- A multimedia presentation is an important way to introduce new concepts or described a new technology. Individuals determine it easy to understand

Transformation, determine the form of the transformation matrix for a refle...

determine the form of the transformation matrix for a reflection about an arbitrary line with equation y=mx+b.

How to identify window area - raster graphics and clipping, A convex polygo...

A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact

Illustration of bezier curves - modeling and rendering, To prove ‾P (1) = p...

To prove ‾P (1) = p n Solution : since in the above case we determine each term excluding B n,n (u) will have numerous of (1 - u) i (i = 0 to n) consequently by using u = 1

Application of sutherland hodgman polygon clipping, For good understanding ...

For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon. Fi

Bezier cubic curves, Q.   What are Bezier cubic curves? Derive their proper...

Q.   What are Bezier cubic curves? Derive their properties. OR  What are Bezier cubic curves? Derive these properties. Also show that the sum of the blending functions is identical

Polygon rendering and ray tracing methods, Polygon Rendering and Ray Tracin...

Polygon Rendering and Ray Tracing Methods In previous section we had discussed various methods for visible-surface detection, although in order to produce visibility the prese

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