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:
牛刀小结曾经的 “东北药茅”，用十年时间缔造神话，却用四年时间把一手好牌打得稀烂。，详情可参考爱思助手下载最新版本
# What about other tools?，详情可参考爱思助手下载最新版本
So how do we keep the power without the syntax tax?