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:
(NB: Fullt) Seminar og lansering av rapport om "enshittification"
，这一点在heLLoword翻译官方下载中也有详细论述
国产没有舒适区，今年依旧卷不停
const cur = nums2[i];
Saver Plan: $9/month, $90/year