Abstract
The densest packings of n equal circles in a square have been determined earlier for n ≤ 20 and for n = 25, 36 . Several of these packings have been proved with the aid of a computer. The computer-aided approach is further developed here and the range is extended to n ≤ 27 . The optimal packings are depicted.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.