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

Passive computer animations - types of computer animation, Passive Computer...

Passive Computer Animations: That has no option for users to utilize computer graphics today is mostly interactive for example: movies. Frame animation is non-interactive anim

Scan conversion, what are the advertising effects of scan conversion

what are the advertising effects of scan conversion

Need for video compression, Need for Video Compression: T he high bit ...

Need for Video Compression: T he high bit rates that result from the various types of digital video make their transmission through their intended channels very difficult. Eve

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Mapping of a fraction -windowing transformations, Mapping of a Fraction -Wi...

Mapping of a Fraction -Windowing Transformations The mapping of a fraction of a world coordinate scene to device coordinates is considered to as Viewing Transformation. In com

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

Graphics image processing-image processing, Graphics Image Processing: The...

Graphics Image Processing: The most generally utilized software is: Photoshop. Characteristics: I.          Most general image processing software. II.         Focuses upon

Shannon fano with the lempel ziv welsh algorithm, Question: (a) A stat...

Question: (a) A statistical encoding algorithm is being considered for the transmission of a large number of long text files over a public network. Part of the file content i

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

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