Metraipolis › archive › dc_22d0f05ebc6e

Painter's algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Painter%27s_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T13:03:50.106Z
SHA-256 of the archived text
723318bdb8c34268e9c0af249beb14693ed0c84bed164dc656fe7685d73b681d
Stable URL of this page
https://metraipolis.com/documento/dc_22d0f05ebc6e

How to cite

Painter's algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Painter%27s_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_22d0f05ebc6e (Metraipolis archive dc_22d0f05ebc6e, sha256 723318bdb8c34268e9c0af249beb14693ed0c84bed164dc656fe7685d73b681d)
BibTeX
@misc{dc22d0f05ebc6e,
  title = {Painter's algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Painter%27s_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_22d0f05ebc6e; sha256 723318bdb8c34268e9c0af249beb14693ed0c84bed164dc656fe7685d73b681d},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Painter%27s_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 determination 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.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Painter's algorithm» — https://en.wikipedia.org/wiki/Painter%27s_algorithm
Wikidata Q936719 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q936719
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Painter%27s_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1371335814, consultata il 2026-10-07T12:34:33.944Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e8275e582f8f0ec14a4c4050e6a7b83a3f8a269d7c062360bec42f9082cf2b0a