Most of the algorithms described here are quite straightforward to implement. Some of them can be written in just a few lines of code, and those that require a bit more effort can be better understood by reading through the relevant papers and links I have provided. The exception to this are those that rely on the Delaunay triangulation to work. Robust Delaunay triangulations in 3D are fairly complex and there isn’t any publicly available software that I’m aware of that leverages them for dithering in the way I’ve described.
14:04, 27 февраля 2026Бывший СССР，这一点在旺商聊官方下载中也有详细论述
2026-02-28 00:00:00:0王世俭3014269210http://paper.people.com.cn/rmrb/pc/content/202602/28/content_30142692.htmlhttp://paper.people.com.cn/rmrb/pad/content/202602/28/content_30142692.html11921 从定西“土山”到江津石佛寺（我家门口有文物），详情可参考51吃瓜
Yeb Havinga (@YebHavinga)