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
(1) Sort a list of distinct numbers in ascending order, using the following divide- and-conquer strategy (Quicksort): divide the list of numbers into two lists: one that contains a

QUESTION (a) Define a tree and list its properties. (b) By showing all your workings, draw the spanning tree for the following graph based on the Breadth-First-Search algori

In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

what is the difference between data type and abstract data type

How to create an General Tree and how to search general tree?

In order to analyze an algorithm is to find out the amount of resources (like time & storage) that are utilized to execute. Mostly algorithms are designed to work along with inputs

whate is meant by the term heuristic

Draw trace table and determine output from the subsequent flowchart using below data:  X = 5, -3, 0, -3, 7, 0, 6, -11, -7, 12

Q. Make a BST for the given sequence of numbers. 45,32,90,34,68,72,15,24,30,66,11,50,10 Traverse the BST formed in  Pre- order, Inorder and Postorder.

Deletion in a RBT uses two main processes, namely, Procedure 1: This is utilized to delete an element in a given Red-Black Tree. It involves the method of deletion utilized in