Example which cause problems for hidden-surface algorithms, Data Structure & Algorithms

Assignment Help:

Example which cause problems for some hidden-surface algorithms

Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic overlap. A penetrating face occurs when polygon A passes through polygon B. Cyclic overlap occurs when polygon A is in front of polygon B, which is in front of polygon C, which is in front of Polygon A. Actually, we need only two polygons for cyclic overlap; imagine a rectangle threaded through a polygon shaped like the letter C so that it is behind the top of the C but in front of the bottom part. For the various hidden-surface methods we have presented, discuss whether or not they can handle penetrating faces and cyclic overlap.

(b)  (i) Show that no polygon subdivision takes place in applying the binary space partition method to a convex object.

(ii)  For the case of convex object compare the cost of the back-face removal method with that of the binary space partition method for a single view.

(iii)  Suppose we wish to display a sequence of views of a convex object. How would the cost of using back-face removal compare to the binary space partition scheme?

(c)  Modify the back-face algorithm for unifilled polygons so that instead of removing back faces it draws them in a less pronounced line style (e.g., as dashed lines).

(d)  Test the painter's algorithm by showing several filled polygons with different interior styles and different states of overlap, entered in mixed order.

(e)  Test the painter's algorithm by showing two houses composed of filled polygons with different interior styles. Select a view such that one house partially obscures the other house.

(f) Sketch the minimax boxes for the tangent polygons shown in figure. What conclusions can you make?

 

642_data structure.png


Related Discussions:- Example which cause problems for hidden-surface algorithms

Define tree ?, A tree is a non-empty set one component of which is designat...

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

Convertion, how we can convert a graph into tree

how we can convert a graph into tree

The space - time trade off, The Space - Time Trade Off The best algorit...

The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic

Frequency count, what is frequency count with examble

what is frequency count with examble

Explain b- tree, B- Tree  A B-tree of order m is an m-way true in which...

B- Tree  A B-tree of order m is an m-way true in which  1)  All leaves are on the similar level 2)  All internal nodes except the root have at most m-1(non-empty) childre

What is a linear array, What is a linear array? An array is a way to re...

What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An  array elemen

Write an algorithm of value in tax using pseudocode, A town contains a tota...

A town contains a total of 5000 houses. Every house owner has to pay tax based on value of the house. Houses over $200 000 pay 2% of their value in tax, houses over $100 000 pay 1.

Sorting algorithms, Sorting is significant application activity. Several so...

Sorting is significant application activity. Several sorting algorithms are obtainable. But, each is efficient for a specific situation or a specific kind of data. The choice of a

Advantage of list over arrays, The advantage of list over Arrays is flexibi...

The advantage of list over Arrays is flexibility. Over flood is not a problem until the computer memory is bushed. When the individual record are quite large, it may be difficult t

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