Wikia

Computer Graphics

Priority fill

Talk0
145pages on
this wiki

In the context of computer graphics, priority fill is a Hidden Line/Surface Removal algorithm which establishes a priority list based upon the depth of parts of an object, so that the parts farthest from the viewer are rendered first.

The algorithm continues in reverse priority, just as an artist would create a painting starting with the background, then elements or objects at an intermediate distance would be added and finally those objects in the foreground. Priority fill is also known as the Painter's algorithm.

An example of another Hidden Line/Removal Surface algorithms is Z-buffering.


Smallwikipedialogo.png This page uses content from Wikipedia. The original article was at Priority fill. The list of authors can be seen in the page history. As with the Graphics Wikia, the text of Wikipedia is available under the GNU Free Documentation License.

Around Wikia's network

Random Wiki