Also known as
  • Add other possible names for this topic
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 necessary at some point to decide which polygon are visible, and which are hidden. The name "painter's algorithm" refers to the technique employed by many painters of painting distant parts of a scene before parts which are nearer thereby covering some areas of distant parts. The painter's algorithm sorts... full article at wikipedia
With the exception of Wikipedia summaries and some images the content on this page is typically distributed under the Creative Commons Attribution license or Public Domain.
The original description for this topic was automatically generated from the Wikipedia article "Painter's algorithm" licensed under the GNU Free Documentation License .
Created by Metaweb Oct 22, 2006
Last edited by mw_client_bot about 3 hours ago
View topic history »
Gallery add edit

Recent Discussions about Painter's algorithm

There are no conversations on this topic. Would you like to start one?

Start the Discussion »

User-created Views