Phong shading algorithm, Computer Graphics

Assignment Help:

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. 

                                                                                                                                 

 


Related Discussions:- Phong shading algorithm

Detecting skin in colour images, In this lab you will learn how to use chro...

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in im

Interactive 3d computer graphics, Describe interactive model of computer gr...

Describe interactive model of computer graphics and application areas of interactive computer graphics.

Steps of cohen sutherland line clipping algorithm, Cohen Sutherland line cl...

Cohen Sutherland line clipping algorithm The algorithm uses the following main steps Divide the entire plane into nine disjoint regions using the four window boundaries

Important notes for negative accelerations, Important Notes for Negative Ac...

Important Notes for Negative Accelerations Note : Having projections of points on curve, above Y axis we will obtain a pattern similar to figure 8 that is needed to produce ne

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

Space exploration-applications for computer animation, Space Exploration: ...

Space Exploration: now, the farthest point far away from earth which the human was on the moon, although we continually want to learn more. A trip by a human to the other planet w

Pears son education, What is scan conversion explain the four adverse side ...

What is scan conversion explain the four adverse side effect of scan conversion

Z-buffer, describe z-buffer algorithm removing hidden surface

describe z-buffer algorithm removing hidden surface

Ray tracing - polygon rendering & ray tracing methods, Ray Tracing - Polygo...

Ray Tracing - Polygon Rendering & Ray Tracing Methods Ray tracing obeys all rays from the eye of the viewer back to the light sources. The method Ray tracing is very good at

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