网格简化
我有几个 1000 个三角形连接在 2D 网格中。它代表水流。该网格是德劳内三角剖分。我需要将三角形合并回最少量的简单多边形，以便每个多边形都被限制为不具有内部孔。输出多边形应该具有相同的形状。
是否有已知的算法可以实现此目的？
I have a few 1000s triangles connected in a 2D mesh grid. It represents water flow. This grid is a delaunay triangulation. I need to merge the triangles back into a minimal amount of simple polygons such that each polygon is constraint not to have interior holes. The output polygons should be the same shape.
Is there a known algorithm for accomplishing this?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
回答我自己的问题:)
我发现最好的方法是使用类似于不相交子集合并的多边形联合方法。这是一篇关于利用空间索引快速实现的博客文章
http://lin-ear-th-inking.blogspot.com/2007/11/fast-polygon-merging-in-jts-using.html
answering my own question :)
I found the best way to do this is to use polygon union methods similar to disjoint subset merging. Here's a blog post on a fast implementation by taking advantage of spatial indices
http://lin-ear-th-inking.blogspot.com/2007/11/fast-polygon-merging-in-jts-using.html