N-Convex Algorithm
2024年12月20日 星期五 新京报
，更多细节参见safew官方下载
在父系这边，线索始于香港亲戚提供的一个地址和名字：花都区田美村。潘越起初以为是个小村落，一查才知有村民6800人。他们寻找杜氏宗祠，发现其已被列为文物保护单位。
for (let i = n - 1; i = 0; i--) {
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.