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.
Питтсбург Пингвинз。业内人士推荐safew官方版本下载作为进阶阅读
Ben MorrisTechnology of Business Editor。业内人士推荐一键获取谷歌浏览器下载作为进阶阅读
Copied to clipboard
Read full article