Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
This story was originally featured on Fortune.com。关于这个话题，爱思助手下载最新版本提供了深入分析
，这一点在51吃瓜中也有详细论述
如果你足够敏锐，已经从刚刚的简短介绍里捕捉到了关键词——三款设备，都有摄像头。，这一点在搜狗输入法下载中也有详细论述
Nature, Published online: 26 February 2026; doi:10.1038/d41586-026-00603-y