A-buffer algorithm

E910383

The A-buffer algorithm is a computer graphics technique for high-quality hidden surface determination and anti-aliasing that stores multiple fragments per pixel to correctly render complex, overlapping, and transparent geometry.

Try in SPARQL Jump to: Statements Referenced by

Statements (40)

Predicate Object
instanceOf anti-aliasing technique
computer graphics algorithm
hidden surface determination technique
assumes fragments can be stored and processed per pixel
canBeImplementedIn hardware-accelerated pipelines
software rendering systems
category anti-aliasing algorithms
visibility algorithms
field computer graphics
handles multiple depth values per pixel
partial pixel coverage
sub-pixel coverage information
transparency compositing
improvesUpon Z-buffer aliasing
influenced modern order-independent transparency techniques
introducedBy Loren Carpenter NERFINISHED
introducedInPublication The A-buffer, an antialiased hidden surface method NERFINISHED
introducedInYear 1984
output anti-aliased images
images with correct transparency compositing
primaryGoal anti-aliasing
correct rendering of transparency
high-quality hidden surface determination
publishedInConference SIGGRAPH NERFINISHED
relatedTo Z-buffer algorithm
requires more memory than Z-buffer
stores multiple fragments per pixel
supports order-independent transparency
overlapping geometry
transparent geometry
supportsOperation alpha blending of fragments
coverage accumulation
fragment sorting by depth
tradeOff image quality versus memory usage
typicalUseCase scenes with complex overlapping geometry
scenes with heavy transparency
usedFor film and visual effects rendering
high-quality offline rendering
usesDataStructure extended frame buffer
per-pixel fragment list

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Loren Carpenter developed A-buffer algorithm