镶嵌的反面是什么？
据我了解，采用多边形并将其分解为复合三角形称为“镶嵌”。相反的过程叫什么？任何人都可以将我链接到它的算法吗？
本质上，我有一个二维三角形列表，我需要一种算法将它们重新组合成多边形。
谢谢！
From what I understand, taking a polygon and breaking it up into composite triangles is called "tesselation". What's the opposite process called and can anyone link me to an algorithm for it?
Essentially, I have a list of 2D triangles and I need an algorithm to recombine them into a polygon.
Thanks!
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（3）
我认为你需要将三角形转换为 半边数据结构，并且那么你应该能够轻松找到没有对边的半边。
I think you need to transform your triangles as a half edge data structure, and then you should be able to easily find the half edges which have no opposite.
这称为网格抽取。这是我为类执行此操作而编写的一些代码。 Tibur 是正确的，半边数据结构使得这更加高效。
http://www.cs.virginia.edu/~mjh7v/advgfx/proj1/
It's called mesh decimation. Here is some code I wrote to do this for a class. Tibur is correct that the half edge data structure makes this much more efficient.
http://www.cs.virginia.edu/~mjh7v/advgfx/proj1/
您所说的曲面细分实际上称为三角剖分。您正在搜索的是曲面细分（您可能听说过它称为平铺）。
如果您对要解决的问题更具体（例如，您知道最终多边形的形状吗？），我可以尝试推荐一些更具体的算法。
The thing that you are calling tessellation is actually called triangulation. The thing you are searching for is tessellation (you may have heard of it referred to as tiling).
If you are more specific about the problem you are trying to solve (e.g. do you know the shape of the final polygon?) I can try to recommend some more specific algorithms.