What is gouraud shading, Data Structure & Algorithms

Assignment Help:

Gouraud Shading

The faceted appearance of a Lambert shaded model is due to each polygon having only a single colour. To avoid this effect, it is necessary to vary the colour across a polygon :

In order to achieve this, the colour must be calculated for each pixel instead of one colour for the entire polygon. By ensuring that the method we use to calculate the colour results in the neighbouring pixels across the border between two polygons end up with approximately the same colours, we will be able to blend the shades of the two polygons and avoid the sudden discontinuity at the border. Lambert shading is based upon calculating a single normal vector for the surface (which is then compared to the lighting vector and the viewpoint vector to determine the colour). Gouraud shading is based upon calculating a vertex normal rather than a surface normal. A vertex normal is an artificial construct (a true normal cannot exist for a point such as a  Visual Realism vertex). A vertex normal can be thought of as the average of the normals of all the polygons that share that vertex.

 

1497_data structure.png


Related Discussions:- What is gouraud shading

Explain about the string abstract data type operations, Explain about the S...

Explain about the String Abstract data type operations Symbol ADT has no concatenation operations, but presuming we have a full-featured String ADT, symbols can be concatenated

Draws a rectangular grid algorithms, Prepare a GUI called Hotplate GUI that...

Prepare a GUI called Hotplate GUI that holds a central panel that draws a rectangular grid that represents Element objects which should be held in a 2-dimensional array. The applic

Worst case and average case, Worst Case: For running time, Worst case runn...

Worst Case: For running time, Worst case running time is an upper bound with any input. This guarantees that, irrespective of the type of input, the algorithm will not take any lo

Sorting, explain quick sort algorithm

explain quick sort algorithm

Ways to implement abstract data types, Ways to implement abstract data type...

Ways to implement abstract data types A large part of the study of data structures and algorithms is learning about alternative ways to implement an ADT and evaluating alternat

Determine the components of illumination, Determine the Components of Illum...

Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

State the symbols of abstract data type operation, Symbols of ADT oepration...

Symbols of ADT oeprations All Symbol ADT operations are implemented in Symbol class, except toSymbol(), which is implemented in classes (like String) which can generate a Symb

Explain merge sort, Merge sort: Merge sort is a sorting algorithm that ...

Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

What are the advantages of using assertions, Using Assertions When writ...

Using Assertions When writing code, programmer must state pre- and subtle post conditions for public operations, state class invariants and insert unreachable code assertions a

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