UPDATE: Read the solution here
because I can simply do this:。关于这个话题，WPS官方版本下载提供了深入分析
软件费用列出的是年度订阅的最低套餐，截止时间 2026 年 1 月 15 日；，这一点在Line官方版本下载中也有详细论述
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.