Read full article
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官方版本下载提供了深入分析
Мир Российская Премьер-лига|19-й тур
Pak Declares "Open War", Bombs Kabul, Kandahar After Afghanistan Attack，这一点在im钱包官方下载中也有详细论述
Randomly selecting border points or using simple geometric divisions (squares/hexagons) results in too many border points per cluster (50-80). This leads to a shortcut explosion (N*(N-1)/2 shortcuts), making the files large and and calculations slow.，推荐阅读safew官方下载获取更多信息
Blue: Kinds of chain reaction "effects"