Painter's Algorithm

Painter's algorithm is an easy to implement, completely non-optimised method for rendering 3D environments. Each object is rendered in turn, starting with that which is furthest away from the viewpoint, and then successively closer items are rendered. Painter's algorithm uses no clipping, no occlusion mapping; occluded objects are simply 'painted over' when the closer objects are drawn in front.

An additional problem occurs when you have multiple objects which overlap one another, such that both objects are both in front of, and behind one another. This type of scenario can lock painter?s algorithm in an infinite loop, as it struggles to work out which one to render first, so that the other one can be painted over it.

As a result, whilst it is cheap and easy to implement, the algorithm is one of the worst available methods for dynamic scene rendering.

Painter's Algorithm is also known as Priority Fill.

See Also: Reverse Painter's Algorithm

Below, we offer a selection of links from our resource databases which may match this term.

None.

Results by page [1]   

Reconstructing Cities in a Day
A computer algorithm developed at the University of Washington uses hundreds of thousands of tourist photos to automatically reconstruct an entire city in about a day.

WARP: Accelerating Wireless Technology Development
Prior to 2006, any attempt at investigating wireless technology, developing a new algorithm for propagation, or even trying for a whole new standard, all shared one thing in common: The phenomenal expense for the research team.

The Omni-focus
The omni-focus is a camera system with the ability to function much like the human eye - capturing objects in its field of vision regardless of the distance, in perfect focus. It even adapts an algorithm from VR, in order to do so.

Results by page