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:
Фото: Влад Некрасов / Коммерсантъ
，更多细节参见safew官方版本下载
第四十九条 胁迫、诱骗或者利用他人乞讨的，处十日以上十五日以下拘留，可以并处二千元以下罚款。
Александра Лисица (Редактор отдела «Забота о себе»)