https://feedx.net
palette: “black ink tones”
，这一点在WPS下载最新地址中也有详细论述
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:。快连下载安装是该领域的重要参考
新加坡動畫工作室「小島動漫」（Tiny Island Productions）負責人郭大衛（David Kwok）指出，該系統產出的複雜動作場景比競爭對手更具真實感。，详情可参考夫子