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.
Ellipse Generation Algorithm You know that a circle is symmetric in all the octants, while ellipse is symmetric with respect to four quadrants. Therefore, to draw an ellipse,
2D Shape Primitives You have already learnt to plot a point or a pixel on any display device. In this unit, we shall introduce you to various devices available for data input o
Assumption for Diffuse Reflection - Polygon Rendering i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie
2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.
Write a C code for generating concentric circles. Put the circle function circleMidpoint()in a for loop as follows: for( int radius = MinRadius; radius circleMidpoint(i
Algorithms for filled-area primitives These algorithms are classified into two categories (i) Scan line algorithms (ii) Seed fill algorithms.
Visible Surface Detection - Modeling and Rendering Provided a set of 3-Dimentional objects and a viewing position for the generation of realistic graphics show, we want to de
Question 1: (a) Describe the term Mask Path and give brief steps how you could change a rectangle into a triangle with respect to time in AE CS3. (b) Expressions are ve
Containment Test - visible surface detection Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. The
Parallel Projection - viewing transformation Parallel projection methods are utilized by engineers to make working drawings of an object that preserves its true shape. In t
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