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:
Обвинения США против Ирана описали фразой «строят самолет в процессе полета»08:51。体育直播是该领域的重要参考
杜拜：中東樞紐在伊朗攻擊下陷入困境，機場碼頭和著名酒店現場直擊，更多细节参见同城约会
type AddInit[T] = typing.NewProtocol[。一键获取谷歌浏览器下载是该领域的重要参考
byobRequest.respond(bytesToWrite);