Enter, the Omni-Trap.
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:，推荐阅读同城约会获取更多信息
Last Hours: Save up to $680 on your pass before 11:59 p.m. tonight.。关于这个话题，同城约会提供了深入分析
set pixel as palette[i]