This report contains an analysis of two different algorithms that are used to solve the visibility problem. The visibility problem occurs when 3D-images are rendered onto the image plane. The algorithms analyzed are Painter's algorithm and Z-buffering. These two help during the process of rendering with deciding the depth of a polygon or object in the picture. Both algorithms have their pros and cons which are discussed. Finally the report consists of an attempt of combining these two algorithms to see if there can be any improvement and if it is possible to implement this combination. There is a small improvement in the combination but many of the flaws are still there. An implementation is possible but it is not encouraged as the Z-buffering algorithm is already built-in into the hardware.