This algorithm attempts to minimise numerically. Because of this, the quality of the dither produced by Knoll’s algorithm is much higher than any other of the N-candidate methods we have covered so far. It is also the slowest however, as it requires a greater per-pixel to be really effective. More details are given in Knoll’s now expired patent[3]. I have put together a GPU implementation of Knoll’s algorithm on Shadertoy here.
他補充說：「春天時一個漢堡500萬里亞爾（3.81美元），現在要1200 萬（9.13美元）。這些數字根本無法理解。」
，这一点在搜狗输入法2026中也有详细论述
圖像來源，AFP via Getty Images
但正如我们公司 T 恤印着的：