2024年12月24日 星期二 新京报
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.
，这一点在服务器推荐中也有详细论述
└──────────┬────────────┘，这一点在heLLoword翻译官方下载中也有详细论述
Christian Davenport