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

Cel animation - computer animation, Cel Animation - Computer Animation ...

Cel Animation - Computer Animation Making an animation by using this method, all characters are drawn on a separate piece of transparent paper. Also a background is drawn on a

Softwares and hardwares for computer animation, Softwares and Hardwares for...

Softwares and Hardwares for Computer Animation The categories of both software as well as hardware needed to work on animation are now to be discussed. Computer animation can b

Plane equation - spatial orientation of the surface element, Plane equation...

Plane equation - spatial orientation of the Surface Element For some of Plane equation procedures, we have information regarding the spatial orientation of the individual surf

Functioning of hardcopy devices and output primitives, Functioning of hardc...

Functioning of hardcopy devices and Output primitives 1.  Functioning of hardcopy devices-laser printers and dot matrix printers, plotters.  2.  Output primitives: Graphics

Exemplify bresenham line generation algorithm by digitizing, Example: Exem...

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

Clipping and 3d primitives, Clipping and 3D Primitives This unit introd...

Clipping and 3D Primitives This unit introduces you to three important concepts of Computer Graphics. After that discusses the concept of clipping, which means removal of objec

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

Projections - viewing transformation, Projections - Viewing Transformation ...

Projections - Viewing Transformation Specified 3-D object in a space, Projection can be explained as a mapping of 3-D object into 2-D viewing screen. Now, 2-D screen is termed

Rigid body or non-rigid body transformations, Rigid body or Non-Rigid body ...

Rigid body or Non-Rigid body Transformations 2D transformations can be classified as rigid body or non-rigid body transformations. Rigid body transformations keep the shape and

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

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