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

Color histogram, A color histogram is a representation of the distribution ...

A color histogram is a representation of the distribution of colors in an image. For digital images, a color histogram represents the number of pixels that have colors in each of a

Design the poster taking, Question : (a) With the help of illustrations...

Question : (a) With the help of illustrations, briefly describe the influence of the following style on layout and typographic design: (i) Bauhaus (ii) Avant Garde (iii)

Low level techniques or motion specific, Low Level Techniques or Motion Spe...

Low Level Techniques or Motion Specific These techniques are utilized to control the motion of any graphic element in any animation scene completely. These techniques are also

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Display necessitate to store z-buffer?, Suppose here, one allows 256 depth ...

Suppose here, one allows 256 depth value levels to be employed. Approximately how much memory would a 512x512 pixel display necessitate to store z-buffer? Solution : A system w

Polygon surfaces - curves and surfaces, Polygon Surfaces - Curves and Surfa...

Polygon Surfaces - Curves and Surfaces   By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i

Advantages of scan line algorithm, Advantages of Scan line Algorithm:  ...

Advantages of Scan line Algorithm:   This time and always we are working along with one-dimensional array as: x[0...x_max] for color not a 2D-array like in Z-buffer algorithm.

Vanishing point - viewing transformations, Vanishing Point - Viewing Transf...

Vanishing Point - Viewing Transformations This point is that point at those parallel lines shows to converge and vanish. A practical illustration is a long straight railroad

2d and 3d virtual environments , I need different convincing virtual enviro...

I need different convincing virtual environments (2D and 3D) that alter size perception. In particular, for 2D environment or background, when any object is augmented with the 2D e

Output primitives and geometric transformations, Output Primitives and Geom...

Output Primitives and Geometric Transformations You learnt how some basic geometric objects such as line segments, circles, ellipses and other curves are processed for plotting

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