不规则的多边形细分？
我有一个问题，其中我有一个不规则的多边形容器，该容器需要细分，以便它包含某些较小的特定尺寸矩形。我以前曾尝试使用垃圾包装方法解决这个问题，这似乎太耗时了。结果，我想尝试基于细分的方法，在该方法中，该算法确保子划分包含特定维度的某些较小矩形，而其余空间则被视为空白空间。关于快速算法的任何建议，最好使用肤浅的库来生成这些细分？
不规则的多边形容器看起来像下面的图。容器的边缘始终是直角的，众所周知，要包装的物品都可以适合给定的容器，并具有额外的剩余可用空间。约束与常规的Bing包装相同，其中项目不应重叠，所有项目都应完全在容器内。这些项目可以旋转（最好是成直角）。
I have a problem in which I have an irregular polygon shaped container which needs to be sub-divided such that it contains certain smaller rectangles of specific dimensions. I have previously tried addressing this problem using a bin packing approach which seems to be too time consuming. As a result I wanted to try out sub-division based approaches where the algorithm ensures that the sub-division contains certain smaller rectangles of specific dimensions while the remaining space can be considered as empty space. Any suggestions on fast algorithms for the generation of these sub-divisions preferably using the shapely library?
The irregular polygon container would look some thing like the diagram below. The edges of the container will always be right angles and it is known that items to be packed can all fit in to the given container with additional remaining free space. The constraints are the same as regular bing packing where the items should not overlap and all items should be completely within the container. The items can be rotated (preferably at right angles).
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论