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
application of threaded binary treee

Graph Traversal In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as spe

A queue is a particular type of collection or abstract data type in which the entities in the collection are went in order and the principal functions on the collection are the add

Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

Q. Write a procedure to the insert a node into the linked list at a particular position and draw the same by taking an example?

Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr

advanatges of dynamic data structure in programming

Write the non-recursive algorithm to traverse a tree in preorder.    The Non- Recursive algorithm for preorder traversal is as follows: Initially  push NULL onto stack and

Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

Write a C++ program with header and source les to store street addresses using the Doubly Linked List ADT. Modify the Node class from Lab Assignment 3 so that it becomes a node in