The old location-sharing option was only for a static point.
Instead of taking the nearest candidates to , we can look for a set of candidates whose centroid is close to . The N-convex algorithm works by finding the closest colour to a given target colour for iterations, where the target is first initialised to be equal to the input pixel. Every iteration the closest colour added to the candidate list, and the quantisation error between it and the original input pixel is added to the target.
，推荐阅读safew官方版本下载获取更多信息
�@�������i�l�^�̎������ƂȂ����T�[�����ł����A���̔w�i�ɂ́A�V�R���Ƃ͂܂������قȂ��u�v���I�Ȑ��Y�r�W�l�X�v�������܂��B�T�[�����́A�{�B�Z�p�̔��W�ƍ��ۗ��ʂ̐����ɂ����āA���E�K�͂̋����Y�ƂւƐ������܂����B
针对网络上的两处核心误解，我们做出如下说明：