Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
The question is really simple, i have an array of random sized squares (width, height) and a fixed width surface. What’s the best efficient algorithm to arrange squares on this surface? There must be no useless gap between squares. Is it possible at all? Without using AI or heavy processing?
Something similar to this picture, but assume that my surface is not bounded at bottom, its a fixed-width and unbounded height surface.
This problem is called 2d bin packing. Here’s a way to tackle it:
http://codeincomplete.com/posts/2011/5/7/bin_packing/