Category:Painter's problem
Jump to navigation
Jump to search
graphics algorithm in which polygons in a scene are sorted by depth and painted in this order, farthest to closest  | |||||
| Upload media | |||||
| Instance of | |||||
|---|---|---|---|---|---|
| Different from | |||||
| |||||
 | |||||
Media in category "Painter's problem"
The following 7 files are in this category, out of 7 total.
-
Genesis fractal landscape software (Commodore Amiga).webm 22 s, 1,920 × 1,080; 6.3 MB
-
Painter's algorithm.png 1,075 × 269; 27 KB
-
Painter's algorithm.svg 992 × 252; 32 KB
-
Painters problem.png 100 × 100; 6 KB
-
Painters problem.svg 340 × 360; 801 bytes
-
Polygons cross.svg 599 × 369; 9 KB
-
Zacyklenimalir.svg 572 × 264; 3 KB
