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

Advantages of first in first out method, Advantages of First in First out (...

Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Implement the physat algorithm, The first assignment in this course require...

The first assignment in this course required you to acquire data to enable you to implement the PHYSAT algorithm (Alvain et al. 2005, Alvain et al. 2008) in this second assignment

Inorder and preorder traversal to reconstruct a binary tree, Q. Using the f...

Q. Using the following given inorder and preorder traversal reconstruct a binary tree Inorder sequence is D, G, B, H, E, A, F, I, C

B-tree, Draw a B-tree of order 3 for the following sequence of keys: 2,4,9,...

Draw a B-tree of order 3 for the following sequence of keys: 2,4,9,8,7,6,3,1,5,10.and delete 8 and 10

Standard ways of traversing a graph, Q. Which are the two standard ways of ...

Q. Which are the two standard ways of traversing a graph?  Explain them with an example of each.  Ans:   T he two ways of traversing a graph are written below

Deletion from a red-black tree, Deletion in a RBT uses two main processes, ...

Deletion in a RBT uses two main processes, namely, Procedure 1: This is utilized to delete an element in a given Red-Black Tree. It involves the method of deletion utilized in

Binary search, An unsorted array is searched through linear search that sca...

An unsorted array is searched through linear search that scans the array elements one by one until the wanted element is found. The cause for sorting an array is that we search

Tree traversals, There are three kinds of tree traversals, namely, Postorde...

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

Binary tree construction, Construct a B+ tree for the following keys, start...

Construct a B+ tree for the following keys, starting with an empty tree.  Each node in the tree can hold a maximum of 2 entries (i.e., order d = 1). Start with an empty root nod

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