Define approximating smooth surfaces with polygon nets, Data Structure & Algorithms

Approximating smooth surfaces with Polygon nets

Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but they are adequate for most computer graphics tasks. One of the commonest uses of the technique is to approximate a cylinder by the use of a set of flat polygons.

The Lambert shading model is a great improvement over wire-frame drawings as far as realism is concerned. It is also a reasonably fast technique when compared to some of the alternatives that we are about to meet. It is, however, far from perfect. Using a different colour for each polygon means that the polygons show up very clearly (the appearance of the model is said to be faceted). This is fine for a cube, but not so good when attempting to use the polygon as part of a smooth surface. Figure 3.22 shows 32 flat surfaces, arranged in a circle, pretending to be a cylinder. The difference in intensity between neighbouring sections can easily be seen.

 

 

Posted Date: 7/25/2013 3:00:02 AM | Location : United States







Related Discussions:- Define approximating smooth surfaces with polygon nets, Assignment Help, Ask Question on Define approximating smooth surfaces with polygon nets, Get Answer, Expert's Help, Define approximating smooth surfaces with polygon nets Discussions

Write discussion on Define approximating smooth surfaces with polygon nets
Your posts are moderated
Related Questions
ALGORITHM (Insertion of element into a linked list) Step 1 Begin the program Step 2 if the list is empty or any new element comes before the start (head) element, then add t

Draw trace table and determine the output from the below flowchart using following data (NOTE: input of the word "end" stops program and outputs results of survey):  Vehicle = c

what is multilist length file organisation? explain with an example

Determine in brief the Painter Algorithm a) The farthest polygon, namely the rectangle PQRS, is stored first. (b) The next farthest, the quadrilateral ABCD, is superpo

Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front

write a algorithsm in c to perform push and pop operations stastic implementation using array ?

What is tha flow chart of algorithm

Example: (Double left rotation while a new node is added into the AVL tree (RL rotation)) Figure: Double left rotation when a new node is inserted into the AVL tree A

AVL tree An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and right subtrees are again

Worst Fit method:- In this method the system always allocate a portion of the largest free block in memory. The philosophy behind this method is that by using small number of a ve