OpenLink Software

Usage stats on Priority fill

 Permalink

an Entity in Data Space: 134.155.108.49:8890

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.

Graph IRICount
http://dbkwik.webdatacommons.org6
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Copyright © 2009-2012 OpenLink Software