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翻译官方下载中也有详细论述
Фото: Артем Соболев / Коммерсантъ。关于这个话题，Line官方版本下载提供了深入分析
res[i] = stack.length ? stack.at(-1) : -1;