Heckbert's median-cut algorithm usually does a great job. See https://web.cs.wpi... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		kragen 59 days ago \| parent \| context \| favorite \| on: Dithering – Part 1 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 59 days ago [–]

That's cool, and resembles my own approach, which I'll reevaluate and polish now :)

kragen 59 days ago | [–]

Delighted to help! I've never implemented it myself.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact