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.
It contains six teeth and has a number stamped on the inside.，更多细节参见heLLoword翻译官方下载
，详情可参考Safew下载
Жители Санкт-Петербурга устроили «крысогон»17:52
Раскрыты подробности похищения ребенка в Смоленске09:27。safew官方版本下载是该领域的重要参考
另一項使用不同方法的「2025 計劃追蹤器」則估算為51%，基本相近。