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].
union alloc_header{，详情可参考heLLoword翻译官方下载
const origSet = srcDesc.set;。关于这个话题，WPS官方版本下载提供了深入分析
�@�u�����������������i�߂��ɂ́A�Ɩ��v���Z�X�̐������O���ƂȂ��BAI�������̕s�\���ȃv���Z�X�����ۂɉ��P���Ă������l���A���͂����܂Ō������Ƃ��Ȃ��v�i�x���g�U�[���j