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

Write functions for both addition and subtraction, You will write functions...

You will write functions for both addition and subtraction of two numbers encoded in your data structure. These functions should not be hard to write. Remember how you add and subt

What do you understand by structured programming, What do you understand by...

What do you understand by structured programming Structured Programming  This term is used for programming design that emphasizes:- (1) Hierarchical design of programmi

Write a program to create a hashed file, Write a program to create a hashed...

Write a program to create a hashed file that stores the records currently in the file " data_2013 ". Records should use the same fixed-length schema given previously, and should ag

Rules for abstract data type-tree, null(nil) = true                     // ...

null(nil) = true                     // nil refer for empty tree null(fork(e, T, T'))= false   //  e : element , T and T are two sub tree leaf(fork(e, nil, nil)) = true leaf(

Explain linked list and its types, Data Structure and Algorithm 1. Exp...

Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

Program for binary search, Illustrates the program for Binary Search. P...

Illustrates the program for Binary Search. Program: Binary Search /*Header Files*/ #include #include /*Functions*/ void binary_search(int array[ ], int value,

Method to add an element in circular queue, Q. Let us consider a queue is h...

Q. Let us consider a queue is housed in an array in circular fashion or trend. It is required to add new items to the queue. Write down a method ENQ to achieve this also check whet

Explain the term heuristics searching, (a) Discuss the role played by Busin...

(a) Discuss the role played by Business Intelligence Systems in giving companies strategic advantage. (b) Explain the term heuristics searching . (c) With the use of an appr

Addressing modes, Compare zero-address, one-address, two-address, and three...

Compare zero-address, one-address, two-address, and three-address machines by writing programs to compute: Y = (A – B X C) / (D + E X F) for each of the four machines. The inst

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