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].
Opens in a new window
，更多细节参见51吃瓜
Failed Units: 1
Visit Facebook Audience Insights From Here