Gourand shading, Computer Graphics

Assignment Help:

This renders a polygon surface by linearly interpolating intensity values across the surface. Intensity values for each polygon are matched with the values of adjacent polygon along the common edges, thus eliminating the intensity discontinuities that can occur in flat shading. Each polygon surface is rendered with Gourand shading by performing the following calculation:  (i) Determine the average unit normal vector at each polygon vertex. (ii) Apply an illumination model to each vertex to calculate the vertex intensity. (iii) Linearly interpolate the vertex intensities over the surface of the polygon. At each polygon vertex we obtain a normal vector by averaging the surface normal of all polygons sharing that vertex. Thus for vertex position V, we obtain the unit vertex normal width the calculation. One we have the vertex normal's, we determine the intensity at the vertices from a lightning model. Incremental calculations are used to obtain successive edge intensity values between scan lines and to obtain successive intensities along a scan line. 

 

 


Related Discussions:- Gourand shading

Cases of clip a line segment-pq, Cases of clip a line segment-pq Case...

Cases of clip a line segment-pq Case 1: As we determine a new value of t E that is value of parameter t for any potentially entering (PE) point we select t max as:  t max

Scan conversion - 2d shape primitives, Scan conversion: For display of...

Scan conversion: For display of a continuously defined object, a method to map a continuous abstract object or shape into a discrete plane of computer display is needed.  This

Light pen - input and output devices, Light Pen - input and output devices ...

Light Pen - input and output devices It is a pointing device. This has a light sensitive tip that is excited while the light is emitted and an illuminated point upon the disp

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

Important points about the bezier curves, Important points about the bezier...

Important points about the bezier curves - modeling and rendering 1) Generalizing the idea of Bezier curve of degree at n based upon n+1 control point p0,.....pn P(0)= P 0

Simulating accelerations - computer animation, Simulating Accelerations - C...

Simulating Accelerations - Computer Animation In previous block, we have seen the dominance and function of mathematics in computer graphics and now, we will undertake the invo

What is raster scan display, What is  Raster Scan Display A raster sca...

What is  Raster Scan Display A raster scan display device using CRT on the other hand directs the electron beam across the screen, one row at a time from top to bottom. In a ra

De casteljau algorithm - 2d clipping algorithms, De Casteljau Algorithm ...

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.

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