The painter’s algorithm is a depth-sorting technique for visible surface determination in 3D computer graphics, where polygons are rendered in order from farthest to closest to the viewer. The process involves sorting surfaces by depth, rasterizing them accordingly, and checking for overlaps to ensure the correct visibility of surfaces. While it is straightforward, the algorithm has drawbacks, including the complexity of sorting, redundancy in pixel redrawing, and high expense.

2. 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.

3. WHAT IS OVERLAPPING ?

4. 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

5. The following are the steps of this algorithm:
1. Sorting of the various surfaces/layers, which is on the basis of their decreasing depth or
we can say the largest value of z.
2. Now scan convert/Rasterize the various surfaces which is in the order starting with the
surface which has greatest depth.
3. 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.
4. In the refresh buffer enter the intensity value for the determined surface i.e. the surface
which is determined to be visible.
5. The above process is going to repeat for all the available surfaces.
6. Stop.
ALGORITHM FOR PAINTER'S METHOD :

6. • 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.

7. THANK YOU