Ordered Dithering with Arbitrary or Irregular Colour Palettes
Summary
This post surveys ordered dithering for arbitrary palettes, contrasting threshold-based methods with error-diffusion and exploring geometric approaches to color quantization. It covers N-closest, N-convex, barycentric coordinates, and triangulated irregular networks, discussing trade-offs in quality, performance, and implementation. It also introduces Tetrapal, a palette triangulator library, with references to foundational papers.