Floyd–Steinberg dithering
Image dithering algorithm
Floyd–Steinberg dithering is an image dithering algorithm first published in 1976 by Robert W. Floyd and Louis Steinberg. It is commonly used by image manipulation software, for example, when converting an image from a Truecolor 24-bit PNG format into a GIF format, which is restricted to a maximum of 256 colors.
Nº Q1324107 ★
Common · History
Floyd–Steinberg dithering
Image dithering algorithm
Floyd–Steinberg dithering is an image dithering algorithm first published in 1976 by Robert W. Floyd and Louis Steinberg. It is commonly used by image manipulation software, for example, when converting an image from a Truecolor 24-bit PNG format into a GIF format, which is restricted to a maximum of 256 colors.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
Floyd–Steinberg dithering is an image dithering algorithm first published in 1976 by Robert W. Floyd and Louis Steinberg. It is commonly used by image manipulation software, for example, when converting an image from a Truecolor 24-bit PNG format into a GIF format, which is restricted to a maximum of 256 colors.
Text: Wikipédia, CC BY-SA 4.0. · Image: Wikimedia Commons (CC BY-SA 3.0) ·
Related cards
Bellman–Ford algorithm
Algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
Nº Q816022 ★★
NIST Post-Quantum Cryptography Standardization
Project by NIST to standardize post-quantum cryptography
Nº Q48809209 ★
Shunting yard algorithm
Stack-based algorithm for parsing infix mathematical expression
Nº Q1199602 ★★
Fast inverse square root
Root-finding algorithm
Nº Q32980 ★★★
Raster graphics
Dot matrix data structure, representing a generally rectangular grid of pixels, or points of color, viewable via a monitor, paper, or other display medium
Nº Q182270 ★★★
Chudnovsky algorithm
Fast method for calculating the digits of π
Nº Q2208385 ★★