Painter's algorithm
The painter’s algorithm (also depth-sort algorithm and priority fill) is an algorithm for visible surface determination in 3D computer graphics that works on a polygon-by-polygon basis rather than a pixel-by-pixel, row by row, or area by area basis of other Hidden Surface Removal algorithms. The painter’s algorithm creates images by sorting the polygons within the image by their depth and placing each polygon in order from the farthest to the closest object.
- Comment
- enThe painter’s algorithm (also depth-sort algorithm and priority fill) is an algorithm for visible surface determination in 3D computer graphics that works on a polygon-by-polygon basis rather than a pixel-by-pixel, row by row, or area by area basis of other Hidden Surface Removal algorithms. The painter’s algorithm creates images by sorting the polygons within the image by their depth and placing each polygon in order from the farthest to the closest object.
- Depiction
- DifferentFrom
- Schlemiel the Painter's algorithm
- Has abstract
- enThe painter’s algorithm (also depth-sort algorithm and priority fill) is an algorithm for visible surface determination in 3D computer graphics that works on a polygon-by-polygon basis rather than a pixel-by-pixel, row by row, or area by area basis of other Hidden Surface Removal algorithms. The painter’s algorithm creates images by sorting the polygons within the image by their depth and placing each polygon in order from the farthest to the closest object. The painter's algorithm was initially proposed as a basic method to address the Hidden-surface determination problem by Martin Newell, Richard Newell, and Tom Sancha in 1972, while all three were working at CADCentre. The name "painter's algorithm" refers to the technique employed by many painters where they begin by painting distant parts of a scene before parts that are nearer, thereby covering some areas of distant parts. Similarly, the painter's algorithm sorts all the polygons in a scene by their depth and then paints them in this order, farthest to closest. It will paint over the parts that are normally not visible — thus solving the visibility problem — at the cost of having painted invisible areas of distant objects. The ordering used by the algorithm is called a 'depth order' and does not have to respect the numerical distances to the parts of the scene: the essential property of this ordering is, rather, that if one object obscures part of another, then the first object is painted after the object that it obscures. Thus, a valid ordering can be described as a topological ordering of a directed acyclic graph representing occlusions between objects.
- Hypernym
- Solutions
- Is primary topic of
- Painter's algorithm
- Label
- enPainter's algorithm
- Link from a Wikipage to an external page
- archive.org/details/computergraphics00fole/page/1174
- www.cs.princeton.edu/courses/archive/spring01/cs598b/papers/greene93.pdf
- www.clear.rice.edu/comp360/lectures/old/HiddenSurfText.pdf
- www.cs.cmu.edu/afs/cs/project/anim/ph/463.96/pub/www/notes/zbuf.2.pdf
- Link from a Wikipage to another Wikipage
- 3D computer graphics
- Addison-Wesley
- Big O notation
- CADCentre
- Category:3D computer graphics
- Category:Computer graphics algorithms
- Dick Newell
- Directed acyclic graph
- File:Genesis fractal landscape software (Commodore Amiga).webm
- File:Painters problem.svg
- Hidden surface determination
- Hidden-surface determination
- Hidden surface removal
- Martin Newell (computer scientist)
- Newell's algorithm
- Pixel
- Polygon
- Rendering (computer graphics)
- Sorting algorithm
- Topological ordering
- Z-buffering
- SameAs
- 55RdR
- Algorithme du peintre
- Algoritmo del pintor
- Algoritmo del pittore
- Algoritmo do pintor
- Algoritmo do pintor
- Algorytm malarza
- m.0cp02
- Maleralgorithmus
- Malířův algoritmus
- Painter's algorithm
- Q936719
- Schildersalgoritme
- Алгоритм художника
- Алгоритм художника
- Նկարչի ալգորիթմ
- 画家のアルゴリズム
- 画家算法
- 화가 알고리즘
- Subject
- Category:3D computer graphics
- Category:Computer graphics algorithms
- Thumbnail
- WasDerivedFrom
- Painter's algorithm?oldid=1124511104&ns=0
- WikiPageLength
- 13323
- Wikipage page ID
- 47028
- Wikipage revision ID
- 1124511104
- WikiPageUsesTemplate
- Template:Citation needed
- Template:Cite book
- Template:Commons category
- Template:Distinguish
- Template:Short description
- Template:Wide image
