Go to worldnews
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.
，推荐阅读服务器推荐获取更多信息
Любовь Ширижик (Старший редактор отдела «Силовые структуры»)
人 民 网 版 权 所 有 ，未 经 书 面 授 权 禁 止 使 用