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.
100% unique and free-plagiarism content。wps对此有专业解读
也有人实名羡慕“天生好运，这种好事从来轮不到我，恭喜楼主好好享受”；还有人开玩笑“他有内存！抓住他！”；，详情可参考谷歌
Что думаешь? Оцени!