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:
paper: “rough sketchbook paper”
，更多细节参见heLLoword翻译官方下载
63-летняя Деми Мур вышла в свет с неожиданной стрижкой17:54
实用、好用的 正版软件，少数派为你呈现 🚀