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.
Normal 0 false false false EN-US X-NONE X-NONE
3-D Transformation The capability to represent or display a three-dimensional object is basically to the knowing of the shape of that object. Moreover, the capability to rotat
Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P
Curve Clipping and Character Clipping As you proceed further, you would see that the methods for curve clipping and character clipping have also been developed based on boundin
Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm? Liang Barsky Line Clipping: Faster line cl
Cases for Subdivisions of Polygon No additional subdivisions of a particular area are desired, if one of the subsequent conditions is true as: Case 1: All the polygons ar
explain the working procedure of crt digram
functions of valuator
Illustration 1: How does the z-buffer algorithm find out which surfaces are hidden? Solution : Depth or Z-buffer algorithm employs a two buffer area each of two-dimensional ar
define raster scan
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