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].
Tony Jolliffe/ BBC News，详情可参考快连下载-Letsvpn下载
Thanks for reading! 🙏🏻。关于这个话题，51吃瓜提供了深入分析
第七十五条 有下列行为之一的，处警告或者五百元以下罚款；情节较重的，处五日以上十日以下拘留，并处五百元以上一千元以下罚款：