← Back to context Comment by kragen 3 months ago Floyd–Steinberg is pretty great when your palette has reasonably-close colors. 4 comments kragen Reply snvzz 3 months ago In my own experience playing with dithering, generating a palette is often harder than the dithering itself. kragen 3 months ago Heckbert's median-cut algorithm usually does a great job. See https://web.cs.wpi.edu/~matt/courses/cs563/talks/color_quant.... There's probably something improved since then, though. snvzz 3 months ago That's cool, and resembles my own approach, which I'll reevaluate and polish now :) 1 reply →
snvzz 3 months ago In my own experience playing with dithering, generating a palette is often harder than the dithering itself. kragen 3 months ago Heckbert's median-cut algorithm usually does a great job. See https://web.cs.wpi.edu/~matt/courses/cs563/talks/color_quant.... There's probably something improved since then, though. snvzz 3 months ago That's cool, and resembles my own approach, which I'll reevaluate and polish now :) 1 reply →
kragen 3 months ago Heckbert's median-cut algorithm usually does a great job. See https://web.cs.wpi.edu/~matt/courses/cs563/talks/color_quant.... There's probably something improved since then, though. snvzz 3 months ago That's cool, and resembles my own approach, which I'll reevaluate and polish now :) 1 reply →
snvzz 3 months ago That's cool, and resembles my own approach, which I'll reevaluate and polish now :) 1 reply →
In my own experience playing with dithering, generating a palette is often harder than the dithering itself.
Heckbert's median-cut algorithm usually does a great job. See https://web.cs.wpi.edu/~matt/courses/cs563/talks/color_quant.... There's probably something improved since then, though.
That's cool, and resembles my own approach, which I'll reevaluate and polish now :)
1 reply →