Bin Packing

[pilou]

Does this is yet existing ?

Say I have a rectangular surface 500500 units (can be any x,y)
Constraints is just to have the maximum of surfaces given : here 126126

• all not 126*126 must be rectangular surfaces!

So something like that : all that is not 126*126 must be rectangular surfaces!

Will be fine if each surface can be also exported as png files

[L i am]

Hi Pilou, I am curious about your question, and am not sure if, you did not explain it well or if I am stupid Could you please give the question with a context like, what you are trying to solve and why, so I can work out which theory is correct

[pilou]

Say I have a Photo: X*Y (X & Y >126)

how trim it for have the maximum of pieces of 126*126?
Trim must be Vertical & Horizontal (as shown on my previous post)
All must be trimed, number of all pieces must be smaller as possible
Photo must be rebuilt with all pieces like a puzzle
Is that more clear ?

MagicaVoxel : it's free!
Context is for this crazzy prog where you can't import images biggest than 126*126 pixels!
But you can import any number of images for assembly them !
minute 2.10 --> topshop is used but with result of images of same size images
I want use any size of the start image!

Here I import an unic image of 126*126 pixel: the tulips' field must be grow!