Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Describe briefly phong shading algorithm.
OR
Write short note on phong shading.
Phong shading Phong shading or normal vector interpolation shading is an accurate method developed by phong Bui Tuong for rendering a polygon surface. It interpolates normal vectors and then apply the illumination model to each surface point. It displays more realistic highlights on a surface and greatly reduces the Match- band effect. A polygon surface is rendered using Phong shading by carrying out the following steps: 1. Determine the average unit normal vector at each polygon vertex. 2. Linearly interpolate the vertex normal over the surface of the polygon. 3. Apply an illumination model along each scan line to calculate project pixel intensities for the surface point. Phong shading method requires considerably more calculations. Surface rending with phong shading can be speed by up using approximations in the illumination model calculations of normal vectors. Fast phong shading approximates the intensity calculations using a Taylor- series expansion and triangular surface patches. Fast phong shading takes approximation twice as long as to render a surface then with Gouraud shading. Normal phong shading using forward difference takes about six to seven times longer then Gouraud shading.
Q. Describe briefly phong shading algorithm. OR Write short note on phong shading. Phong shading Phong shading or normal vector interpo
Phong shading OR Normal Vector Interpolation Shading In Gouraud shading we were doing direct interpolation of intensities although a more exact method for rendering a polygon
Subdivision of polygon Test to find out the visibility of a single surface are made through comparing surfaces that as polygons P along regarding a specified screen area A.
Describe briefly Sutherland Cohen line clipping algorithm. OR Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith
Global illumination model -polygon rendering This illumination model adds to the local model the light which is reflected from the other surfaces to the current surface. This
Computations with Phong Shading Computations involved along with Phong Shading: i) Find out average unit normal vector at each polygon vertex. ii) Linearly interpol
Write short notes on active and passive transformations? In the active transformation the points x and x represent different coordinates of the similar coordinate system. Here
explain the working procedure of crt digram
xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a
Linearly interpolate - Modeling and Rendering I 4 = I 1 + t (I 2 - I 1 ); here t = (|y 1 - y 2 |)/(|y 1 - y 2 |) I D = I A + t (I B - I A ); here t = (|AD|)/(|AB|)
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd