Что думаешь? Оцени!
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.，推荐阅读一键获取谷歌浏览器下载获取更多信息
ARTICLE 19 article19.org🇬🇧，这一点在safew官方版本下载中也有详细论述
更多精彩内容，关注钛媒体微信号（ID：taimeiti），或者下载钛媒体App