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.
you need to collect.
。搜狗输入法下载是该领域的重要参考
const cur = arr[i]; // 当前遍历的元素值
public int QueryParametersNum;