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.
tool's suggestions may not always be applicable or optimal
，更多细节参见safew官方版本下载
Екатерина Улитина (Редактор отдела «Забота о себе»)
「迪士尼 × F1」宣布推出多款联名产品
Treasures found on HS2 route stored in secret warehouse