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.
重复遍历数组，比较相邻元素，如果顺序错误就交换
。Line官方版本下载对此有专业解读
Who is behind this?，更多细节参见safew官方版本下载
Read full article