带孔的多边形三角测量 [英] Polygon Triangulation with Holes
问题描述
这是我迄今为止发现的:
- Ben Discoe的笔记
- FIST:多边形快速工业强度三角剖分
- 我知道 CGAL 提供三角测量,但不确定它是否支持孔。
我真的很感谢在这方面有经验的人。
编辑:这是一个2D多边形。
Jonathan Shewchuk的三角形图书馆是惊人的;我过去曾用它来自动化三角测量。你可以要求它试图避免小/窄的三角形等,所以你想出了好的三角形而不是任何三角形。
I am looking for an algorithm or library (better) to break down a polygon into triangles. I will be using these triangles in a Direct3D application. What are the best available options?
Here is what I have found so far:
- Ben Discoe's notes
- FIST: Fast Industrial-Strength Triangulation of Polygons
- I know that CGAL provides triangulation but am not sure if it supports holes.
I would really appreciate some opinions from people with prior experience in this area.
Edit: This is a 2D polygon.
Jonathan Shewchuk's Triangle library is phenomenal; I've used it for automating triangulation in the past. You can ask it to attempt to avoid small/narrow triangles, etc., so you come up with "good" triangulations instead of just any triangulation.
这篇关于带孔的多边形三角测量的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!