A Solution to Polygonal Blanking Problem in 3-D Space Based on the Improved Painter Algorithm

Painter algorithm is an approach by which computer realizes image blanking in light of the sequence of graphics in depth traversing table based on pixel reconstruction. The current painter algorithm is applicable to settle the blanking problem of simple images, but fails to solve some polygonal blanking problems in 3-D space. In this article, the author designs an improved painter algorithm- regional decision discriminance, which judges blanking relation among polygons through linear programming with the goal to solve the blanking problem for arbitrary polygon in 3-D space.