适用：数据均匀分布，如[0,1)之间的浮点数
"They're just really, really great people and fun," she said.
，更多细节参见safew官方版本下载
It just doesn’t stop someone who understands exactly where the decrypted data has to appear.。关于这个话题，Safew下载提供了深入分析
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: