State the painter algorithm, Data Structure & Algorithms

Assignment Help:

Painter's Algorithm

As the name suggests, the algorithm follows the standard practice of a painter, who  would paint the background (such as a backdrop) first, then the major details (such as a face), and finally the finer details (such as eyes). This is also called Depth Sort or Priority algorithm. 

To determine the specific nature of the relative positions of polygons, it is necessary to define the x-, y-, and z-extents, of a polygon in 3-D space as the respective coordinate ranges of the bounding (i.e. enclosing) box. For the quadrilateral ABCD, the x-extent is (xD - xB), y-extent is (yA - yC), and z-extent is (zB - zD). The x- and y-extents of two polygons will enable decisions to be made on their overlap, and the z-extent will define their relative positions with respect to the viewer.

 


Related Discussions:- State the painter algorithm

Explain the arrays in ruby, Explain the Arrays in Ruby Ruby arrays are ...

Explain the Arrays in Ruby Ruby arrays are dynamic arrays which expand automatically whenever a value is stored in a location beyond current end of the array. To the programmer

Algorithm to insert element to a max-heap sequentially, Q. Write  down the ...

Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.           Ans: The algorithm to insert an element "newkey" to

Linear node is given by means of pointer, A linear collection of data eleme...

A linear collection of data elements where the linear node is given by means of pointer is known as Linked list

Define heap, HEAP  A heap is described to be a binary tree with a key i...

HEAP  A heap is described to be a binary tree with a key in every node, such that  1-All the leaves of the tree are on 2 adjacent levels. 2- All leaves on the lowest leve

Data mining, hello, i need help in data mining assignment using sas em and...

hello, i need help in data mining assignment using sas em and crisp-dm

Pre-order and post order traversal of a binary tree, The pre-order and post...

The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum One node

Determine about the push operation, Determine about the push operation ...

Determine about the push operation A Container may or may not be accessible by keys, so it can't make assumptions about element retrieval methods (for example, it cannot have a

Recursion, i need help in java recursion assignment.

i need help in java recursion assignment.

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