Polygon packing 2D
Posted
by Ilnur
on Stack Overflow
See other posts from Stack Overflow
or by Ilnur
Published on 2010-03-26T22:17:21Z
Indexed on
2010/03/26
22:23 UTC
Read the original article
Hit count: 489
Hi!
I have problem of packing 2 arbitrary polygons. I.e. we have 2 arbitrary polygons. We are to find such placement of this polygons (we could make rotations and movements), when rectangle, which circumscribes this polygons has minimal area.
I know, that this is a NP-complete problem. I want to choose an efficient algorithm for solving this problem. I' looking for No-Fit-Polygon approach. But I could't find anywhere the simple and clear algorithm for finding the NFP of two arbitrary polygons.
© Stack Overflow or respective owner