Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I need determine the maximum number of squares of the given size that can be packed into a circle of the given radius. Squares can be rotated. I'm not sure how complex this problem is and i can find little about it on the other sites.

share|improve this question
    
This sounds like a hard problem. But while I understand the need to pack circular/spherical things (e.g. oranges) into square things (e.g. boxes), why would one want to pack square things in a circle?? –  TMM Mar 2 '12 at 18:21
    
@TMM: I think that there is a thin connection with getting as many silicon wafers (squares?) as possible out of a circular piece. –  André Nicolas Mar 2 '12 at 18:39
add comment

1 Answer

up vote 5 down vote accepted

This is a hard case-by-case problem. This beautiful page shows the records for the smallest circle packed with $n$ unit squares for $n$ from 1 to 35. You can see that there's nothing obvious about most of the solutions. Of course, as you pack more and more squares into a circle, there's less and less to be gained by finding a clever arrangement.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.