Painter's Algorithm https://www old.pptx

qwhttps://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071https://www.slideshare.net/slideshow/convolutional-neural-networks-163522071/163522071

1. The painter’s algorithm (also called as depth-sort algorithm) is an algorithm for visible surface determination in 3D computer graphics that works on a polygon-by-polygon basis of other Hidden-Surface Removal algorithms. Painter’s Algorithm The name of this algorithm is Painter's because it's working is like a painter who creating an oil painting.

2. What is overlapping ?

3. The painter’s algorithm creates images by sorting the polygons within the image by their depth and placing each polygon in order from the farthest to the closest object. The polygons which are at greater distance from the viewer are painted first. After that the nearer polygons are started painted according to the requirement. Then the rectangles are going to check to see whether they overlap each other or not. WORKING

4. The following are the steps of this algorithm: Sorting of the various surfaces/layers, which is on the basis of their decreasing depth or we can say the largest value of z. Now scan convert/Rasterize the various surfaces which is in the order starting with the surface which has greatest depth. Comparing is to be done on the basis of various overlapping surfaces so that the user will determine which surface is to be kept visible. In the refresh buffer enter the intensity value for the determined surface i.e. the surface which is determined to be visible. The above process is going to repeat for all the available surfaces. Stop. Algorithm for Painter's method :

5. • For ordering polygon's, Painter's algorithm is a simple algorithm. advantages: disadvantages: Sorting technique is difficult. Many times it redraws same pixel. Sorting technique is also expensive.

6. Thank you