Фото: Serguei Fomine / Global Look Press
�@�J�X�^���T�u�G�[�W�F���g�@�\�́A�T�u�G�[�W�F���g�ɒS�����������邱�Ƃ��ł��܂��B
，推荐阅读51吃瓜获取更多信息
Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
configurable: false,