带孔的多边形三角剖分 [英] Polygon Triangulation with Holes
问题描述
我正在寻找一种算法或库(更好)来将多边形分解为三角形.我将在 Direct3D 应用程序中使用这些三角形.什么是最佳可用选项?
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?
这是我目前发现的:
- Ben Discoe 的笔记
- FIST:多边形的快速工业强度三角剖分一个>
- 我知道 CGAL 提供三角测量,但我不确定它是否支持空洞.
- 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.
这是一个二维多边形.
推荐答案
Jonathan Shewchuk 的 Triangle图书馆是非凡的;我过去曾用它来自动化三角剖分.您可以要求它尝试避免小/窄三角形等,这样您就可以提出好的"三角剖分,而不仅仅是任何三角剖分.
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屋!