4 ms·

Floyd–Steinberg is pretty great when your palette has reasonably-close colors.

• snvzz 1y ago
  In my own experience playing with dithering, generating a palette is often harder than the dithering itself.
  • kragen 1y ago
    Heckbert's median-cut algorithm usually does a great job. See https://web.cs.wpi.edu/~matt/courses/cs563/talks/color_quant/CQindex.html https://web.cs.wpi.edu/~matt/courses/cs563/talks/color_quant.... There's probably something improved since then, though.
    • snvzz 1y ago
      That's cool, and resembles my own approach, which I'll reevaluate and polish now :)
      • kragen 1y ago
        Delighted to help! I've never implemented it myself.