Painter's algorithm: Difference between revisions

Revision as of 15:10, 30 May 2004

Revision as of 15:14, 30 May 2004

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. Similarly, when you want to use this algorithm in your rendering system, you first sort all the polygons by their depth and then paint them in this order. You will over-paint the parts that are normally not visible and thus solve the visibility problem.

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

Note that this approach has several problems.