Painter's algorithm: Difference between revisions

Revision as of 01:04, 16 October 2005

Revision as of 01:09, 16 October 2005

Line 3:

The name "painter's algorithm" refers to a simple-minded painter who paints the distant parts of a scene at first and then covers them by those parts which are nearer. The painter's algorithm sorts all the polygons in a scene by their depth and then paints them in this order. It will over-paint the parts that are normally not visible and thus solves the visibility problem.

<center>

[[Image:Painter's_algorithm.png|600px|center|thumb|The distant mountains are painted first, followed by the closer meadows; finally, the closest objects in this scene -, the trees -, are painted.]]

</center>

[[Image:Painters_problem.png|right|frame|Overlapping polygons can cause the algorithm to fail]]