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.
This Tweet is currently unavailable. It might be loading or has been removed.
，这一点在雷电模拟器官方版本下载中也有详细论述
int randomIdx = low + rand() % (high - low + 1);
Enterprise: Custom pricing