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.
Европейский союз (ЕС) финансирует милитаризацию граничащих с Россией государств. Об этом заявил член финской партии «Альянс свободы» Армандо Мема в своем аккаунте социальной сети Х.
，这一点在safew官方版本下载中也有详细论述
Дарья Устьянцева (редактор отдела «Мир»)
If executed well, Delaunay-based tetrahedral dithering can outperform the N-convex method and produce results that rival Knoll’s algorithm. The devil is in the detail however, as actually implementing a robust Delaunay triangulator is a non-trivial task, especially where numerical stability is concerned. The additional memory overhead required by the triangulation structure may also be a concern.