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

Morphing - key frame systems, Morphing - Key Frame Systems Transformati...

Morphing - Key Frame Systems Transformation of object shapes from one form to the other is termed as morphing as short form of metamorphism. This method can be applied to any o

Interlaced gif, Interlaced GIF: The conventional which is non-interlaced G...

Interlaced GIF: The conventional which is non-interlaced GIF graphic downloads one line of pixels at one time from top to bottom and browsers display all lines of the image as it

Rotation - 2-d and 3-d transformations, Rotation - 2-D and 3-D transformati...

Rotation - 2-D and 3-D transformations Within 2-D rotation, an object is rotated via an angle θ along w.r.t. the origin. This angle is assumed to be +ive for anticlockwise rot

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Introduction of 2-d and 3-d transformations, Introduction of 2-D and 3-D  ...

Introduction of 2-D and 3-D  Transformations In this, the subsequent things have been discussed in detail as given below: Different geometric transformations as transla

Construction of a solid with a translational sweep, Construction of a Solid...

Construction of a Solid with a Translational Sweep Figure demonstrates construction of a solid along with a translational sweep. Translating the control points of the periodic

Perspective projection, Perspective Projection 1. Perspective projectio...

Perspective Projection 1. Perspective projection gives more realistic appearance and uses the same principle as used in camera. 2. Perspective projection is not an affine tr

Languge, what languge do computers speak

what languge do computers speak

B-spline curves - clipping and 3d primitives, B-spline curves - clipping an...

B-spline curves - clipping and 3d primitives B-spline curves are piecewise polynomial cubes with one or more polynomial pieces with a minimum smoothness requirement.  For examp

Cathode ray tube - graphics hardware, Cathode Ray Tube - Graphics Hardware ...

Cathode Ray Tube - Graphics Hardware Cathode Ray Tube: this is a refreshing display device. The idea of a refreshing display is depicted pictorially is given as: In fact

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