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

Assignment Help:

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.

 

 


Related Discussions:- Define approximating smooth surfaces with polygon nets

Write about enterprise manager, Question 1 . Give the structure of PL/SQL B...

Question 1 . Give the structure of PL/SQL Blocks and explain Question 2 . Differentiate between PL/SQL functions and procedures Question 3 . Explain the following Par

Define wire-frame model, Define Wire-frame Model This skeletal view is ...

Define Wire-frame Model This skeletal view is called a Wire-frame Model. Although not a realistic representation  of the object, it is still very useful in the early stages of

Binary search tree (bst), Q. Explain what do we understand by Binary Search...

Q. Explain what do we understand by Binary Search Tree (BST)? Make a BST for the following given sequence of the numbers. 45, 32, 90, 21, 78, 65, 87, 132, 90, 96, 41, 74, 92

Explain about greedy technique, Explain about greedy technique The  gre...

Explain about greedy technique The  greedy  method  suggests  constructing  a   solution  to  an  optimization  problem   by  a sequence of steps, every expanding a partially c

Explain space complexity, Explain Space Complexity Space Complexity :...

Explain Space Complexity Space Complexity :- The space complexity of an algorithm is the amount of memory it requires to run to completion. Some of the reasons to study space

In order post order, illlustraate the construction of tree of a binary tree...

illlustraate the construction of tree of a binary tree given its in order and post order transversal

Define the internal path length, Define the Internal Path Length The In...

Define the Internal Path Length The Internal Path Length I of an extended binary tree is explained as the sum of the lengths of the paths taken over all internal nodes- from th

Algorithm, Ask question #MWhich of the following is not a characteristic of...

Ask question #MWhich of the following is not a characteristic of good algorithm? inimum 100 words accepted#

Describe data structure?, Typical programming languages such as Pascal, C o...

Typical programming languages such as Pascal, C or Java give primitive data kinds such as integers, boolean, reals values and strings. They give these to be organised into arrays,

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