Gamma-Rapho/Getty Images
The N-closest or N-best dithering algorithm is a straightforward solution to the N-candidate problem. As the name suggests, the set of candidates is given by the closest palette colours to the input pixel. To determine their weights, we simply take the inverse of the distance to the input pixel. This is essentially the inverse distance weighting (IDW) method for multivariate interpolation, also known as Shepard’s method. The following pseudocode sketches out a possible implementation:
，这一点在一键获取谷歌浏览器下载中也有详细论述
Important Routing Notes
在 Ling Studio 用 Ring-2.5-1T 做深度推理、方案拆解、代码重构（负责“想清楚”）