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

Algorithm.., write an algorithm to sort given numbers in ascending order us...

write an algorithm to sort given numbers in ascending order using bubble sort

Breadth first search, While BFS is applied, the vertices of the graph are d...

While BFS is applied, the vertices of the graph are divided into two categories. The vertices, that are visited as part of the search & those vertices that are not visited as part

Graph search using iterative deepening, Prove that uniform cost search and ...

Prove that uniform cost search and breadth- first search with constant steps are optimal when used with the Graph-Search algorithm (see Figure). Show a state space with varying ste

Cohen sutherland algorithm, Using the cohen sutherland. Algorithm. Find the...

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Algorithsm, What are the properties of an algorithsm?

What are the properties of an algorithsm?

Deletion of a node from an avl tree, For AVL trees the deletion algorithm i...

For AVL trees the deletion algorithm is a little more complicated as there are various extra steps involved in the deletion of node. If the node is not a leaf node, then it contain

Determine about the post conditions assertion, Determine about the Post con...

Determine about the Post conditions assertion A  post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ

Construction of a binary tree , Q. Construct a binary tree whose nodes in i...

Q. Construct a binary tree whose nodes in inorder and preorder are written as follows: Inorder : 10, 15, 17, 18, 20, 25, 30, 35, 38, 40, 50 Preorder: 20, 15, 10

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