All geek questions in one place

Packing the correct polygons into a square

I am trying to find out if this problem can be simplified with the help of these restrictions. You have n regular s-sided polygons for s between 3 and 12. They all have the same length. We need to minimize the area of ​​the bounding square.

I would think that having all the usual sides with the same length, packaging could be easier, as some configurations will always fit perfectly together. Although I'm not sure if this property is useful, since a local minimum cannot translate into a global minimum.

+4
source share
1 answer

,

, , , - 2r^2

, , N , size >= N * 2r^2, , , .

, :

enter image description here

-, , m

r

2r^2

enter image description here

, , , , M x M, M * M >= N

0

Source: https://habr.com/ru/post/1529420/

More articles:


All Articles