This proposal is less “strictly-typed” than TypeScript
Knowing this, we can modify the N-Convex algorithm covered earlier such that the candidate weights are given by the barycentric coordinates of the input pixel after being projected onto a triangle whose vertices are given by three surrounding colours, abandoning the IDW method altogether1. This results in a fast and exact minimisation of , with the final dither being closer in quality to that of Knoll’s Algorithm.
，这一点在旺商聊官方下载中也有详细论述
for (int i = 0; i < n; i++) {
John Regehr, March 2