The tree behind the grid
ITmedia�̓A�C�e�B���f�B�A�������Ђ̓o�^���W�ł��B，这一点在旺商聊官方下载中也有详细论述
Семен Александров (старший редактор отдела Мир)。关于这个话题，快连下载安装提供了深入分析
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.