Painter's algorithm: Difference between revisions

Revision as of 02:35, 10 October 2006

Revision as of 11:32, 18 October 2006

Line 1:

<math>Insert formula here</math>--[[User:61.247.242.152|61.247.242.152]] 11:32, 18 October 2006 (UTC)

The '''painter's algorithm''', also known as a '''priority fill''', is one of the simplest solutions to the [[visibility problem]] in [[3D computer graphics]]. When projecting a 3D scene onto a 2D plane, it is at some point necessary to decide which [[polygon]]s are visible and which are [[Hidden surface determination|hidden]].

----

#REDIRECT [[Insert text]]'''Bold text'''''Italic text''[[Link title]]The '''painter's algorithm''', also known as a '''priority fill''', is one of the simplest solutions to the [[visibility problem]] in [[3D computer graphics]]. When projecting a 3D scene onto a 2D plane, it is at some point necessary to decide which [[polygon]]s are visible and which are [[Hidden surface determination|hidden]].

The name "painter's

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.

== Headline text ==

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