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:
Филолог заявил о массовой отмене обращения на «вы» с большой буквы09:36
。关于这个话题，新收录的资料提供了深入分析
Путин поздравил российских женщин с 8 МартаПрезидент России Путин поздравил женщин с 8 Марта
A step function: