Do a second pass to clean up the code/comments and make further optimizations
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:
，更多细节参见搜狗输入法2026
The science doesn't steal the romance – rather it's there to help it bloom, in good times and bad, according to Carroll.
Poly/Why Choose/Reverse Harem