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

What is a blobby object, What is a Blobby object?  Some objects do not ...

What is a Blobby object?  Some objects do not handle a fixed shape, but change their surface characteristics in sure motions or when in proximity to other objects. That is call

Polygon filling algorithm - raster graphics and clipping, Polygon Filling A...

Polygon Filling Algorithm - Raster Graphics and Clipping In several graphics displays, this becomes essential to differentiate between different regions by filling them along

How many key frames does a one-minute animation film, How many key frames d...

How many key frames does a one-minute animation film order along with no duplications need? Solution : One minute = 60 seconds Number of frames needed per second=24 Numbe

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Hypertext, Hypertext: it is conceptually very similar as regular text: it ...

Hypertext: it is conceptually very similar as regular text: it can be stored, searched, read, or edited along with a significant difference: hypertext is text along with pointers

Composite transformations - 2-d and 3-d transformations, Composite Transfor...

Composite Transformations - 2-d and 3-d Transformations We can build complicated transformations as rotation regarding to an arbitrary point, mirror reflection about a line, a

Key frame systems, Ask questionkms eey frame syst #Minimum 100 words accept...

Ask questionkms eey frame syst #Minimum 100 words accepted#

Hypermedia, Hypermedia: it is a superset of hypertext. Hypermedia document...

Hypermedia: it is a superset of hypertext. Hypermedia documents comprise links not only to the other pieces of text, although also to other forms of media: sounds and images and m

Dda or digital differential analyzer algorithm, DDA or Digital Differential...

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi

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