## 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? bfs and dfs

#### Union & intersection of two linklist, how to write an algorithm for unions ...

how to write an algorithm for unions & intersection of two linklists?

#### Train reorganising, A freight train from Melbourne is approaching Sydney, c...

A freight train from Melbourne is approaching Sydney, carrying n cars of cargos. The cargos are to be delivered to n different cities in the metropolitan area of Sydney - one car f

#### Full binary trees, Full Binary Trees: A binary tree of height h that had 2...

Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of

#### Binary codes, what is alphanumerical code

what is alphanumerical code

#### Define the term - array, Define the term - Array A fixed length, ord...

Define the term - Array A fixed length, ordered collection of values of same type stored in contiguous memory locations; collection may be ordered in several dimensions.

#### Function performs multiplication of two numbers, You need to write a functi...

You need to write a function that performs multiplication of two numbers in your data structure. Again, remember how you multiply numbers in base 10 and you should be fine. Multipl

#### Variable length codes, Variable length codes (Niveau I) Code the following ...

Variable length codes (Niveau I) Code the following sequence of integers (2, 4, 2, 8, 3, 1, 4, 5, 13, 2) with • unary codes • ? codes • d codes • Rice codes (for a suitable l) and

#### Process of accessing data stored in a serial access memory, The process of ...

The process of accessing data stored in a serial access memory is same to manipulating data on a By using stack  method.

#### Explain th term input and output- pseudocode, Explain th term input and ou...

Explain th term input and output-  Pseudocode Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.  