Determine in brief the painter algorithm, Data Structure & Algorithms

Assignment Help:

Determine in brief the Painter Algorithm

772_data structure.png

a) The farthest polygon, namely the rectangle PQRS, is stored first.

(b) The next farthest, the quadrilateral ABCD, is superposed, covering the  portion PQUT of the rectangle and leaving visible the portion TURS of the rectangle.

(c) Finally the closest, namely the triangle EFG, is superposed, entirely within the quadrilateral, and covering it in the region EFG.

The primary requirement for this algorithm is the sorting of polygons by priority, depending on whether a polygon covers (or is covered by) another polygon partly or wholly. This determination is made by comparing the x-, y-, and z-extents of the various polygons.

In case the z-extents of any two polygons overlap, then, if the two polygon planes are parallel to each other there is obscuring of one by the other; if the two polygon planes are not parallel, they may intersect each other. In such cases, the covered/uncovered or penetrated invisible/visible portions are determined by geometrical and clipping procedures, including the determination of the line of intersection of the two polygons if necessary, and separated into independent regions.

 

 


Related Discussions:- Determine in brief the painter algorithm

Determine the complexity, 1)    The set of the algorithms whose order is O ...

1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

Doubly linked list, How does operations like insertion, deletion occur?

How does operations like insertion, deletion occur?

Representing sparse matrix in memory using array, Q. What do you understand...

Q. What do you understand by the term sparse matrix? How sparse matrix is stored in the memory of a computer? Write down the function to find out the transpose of a sparse matrix u

Applications of binary trees, In computer programming, Trees are utilized ...

In computer programming, Trees are utilized enormously. These can be utilized for developing database search times (binary search trees, AVL trees, 2-3 trees, red-black trees), Gam

Entity relationship diagram, This question is based on the requirements of ...

This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

Show that towers of hanoi is o (2n), Question 1 Discuss the advantages of ...

Question 1 Discuss the advantages of implementation checks preconditions Question 2 Write a ‘C' program to search for an item using binary search Question 3 Show that To

What do you mean by hash clash, What do you mean by hash clash? Hashing...

What do you mean by hash clash? Hashing is not perfect. Occasionally, a collision occurs when two different keys hash into the same hash value and are assigned to the same arra

Breadth-first search, Breadth-first search starts at a given vertex h, whic...

Breadth-first search starts at a given vertex h, which is at level 0. In the first stage, we go to all the vertices that are at the distance of one edge away. When we go there, we

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