欢迎搜索并关注 公众号「稀有猿诉」 获取更多的优质文章！
Фото: Yevhen Prozhyrko / Shutterstock / Fotodom
。搜狗输入法下载对此有专业解读
Израиль нанес удар по Ирану09:28
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: