This update was contributed thanks to GitHub user Renegade334.
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.
，更多细节参见新收录的资料
Иран высказался об инциденте в НахичеваниМИД Ирана: Тегеран поддерживает контакт с Баку из-за инцидента в Нахичевани，推荐阅读新收录的资料获取更多信息
On GitHub Actions: