the context:
an artpiece where i iteratively fit irregular blobs into a square and paint the outcome with my drawing robot.
the problem:
I have a bunch of irregular shapes that
- can resize between a maxsize and a minsize
- can rotate
- are irregular in shape
and i need to place them, one by one, in a rectangular so i minimize the empty space.
Special problem constraints:
- i need to place them, one by one, and do the computation only for the next item, i cannot use packing algos that know the next items, in plural, since that information does not exist.
.
My question:
- What is the name of this problem ?
- Can you give some directions on how to approach this, relevant papers etc?
my question is related to Packing An Irregular Polygon with Different Sized Circles