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:
🌏 Part 4. 落地场景延伸：从 Tool 到 Partner，详情可参考heLLoword翻译官方下载
聚焦全球优秀创业者，项目融资率接近97%，领跑行业。搜狗输入法2026是该领域的重要参考
В России ответили на имитирующие высадку на Украине учения НАТО18:04