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

Data structure for representing numbers, Your first task will be to come up...

Your first task will be to come up with an appropriate data structure for representing numbers of arbitrary potential length in base 215. You will have to deal with large negative

Execute algorithm to convert infix into post fix expression, Q. Execute you...

Q. Execute your algorithm to convert the infix expression to the post fix expression with the given infix expression as input Q = [(A + B)/(C + D) ↑ (E / F)]+ (G + H)/ I

Linked list, write an algorithm for multiplication of two sparse matrices u...

write an algorithm for multiplication of two sparse matrices using Linked Lists

Worst case and average case, Worst Case: For running time, Worst case runn...

Worst Case: For running time, Worst case running time is an upper bound with any input. This guarantees that, irrespective of the type of input, the algorithm will not take any lo

Determine yiq colour model, Determine YIQ Colour Model Whereas an RGB m...

Determine YIQ Colour Model Whereas an RGB monitor requires separate signals for the red, green, and blue components of an image, a television monitor uses a single composite si

Define the term array, Define the term array. An array is a way to refe...

Define the term array. An array is a way to reference a series of memory locations using the same name. Each memory location is represented by an array element. An  array eleme

Explain the halting problem, Explain the halting problem Given a comput...

Explain the halting problem Given a computer program and an input to it, verify whether the program will halt on that input or continue working indefinitely on it.

Merging, Merging two sequence using CREW merge

Merging two sequence using CREW merge

Implement an algorithm to simulate car re-organizing, Design  and implement...

Design  and implement  an algorithm  to simulate car  re-organizing of the train at the railway switching junction. You can only use stacks as the data structure to represent the t

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