Mathematics – Metric Geometry
Scientific paper
2004-12-22
Discrete Mathematics, vol.309 (28 April 2009), 1947-1962
Mathematics
Metric Geometry
existence of irregular minimum perimeter packings for n not of the form (10) is conjectured; smallest such n is n=66; existenc
Scientific paper
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings found, the circles form the usual regular square-grid or hexagonal patterns or their hybrids. However, for most values of n in the tested range n =< 5000, e.g., for n = 7, 13, 17, 21, 22, 26, 31, 37, 38, 41, 43...,4997, 4998, 4999, 5000, we prove that the optimum cannot possibly be achieved by such regular arrangements. Usually, the irregularities in the best packings found for such n are small, localized modifications to regular patterns; those irregularities are usually easy to predict. Yet for some such irregular n, the best packings found show substantial, extended irregularities which we did not anticipate. In the range we explored carefully, the optimal packings were substantially irregular only for n of the form n = k(k+1)+1, k = 3, 4, 5, 6, 7, i.e., for n = 13, 21, 31, 43, and 57. Also, we prove that the height-to-width ratio of rectangles of minimum perimeter containing packings of n congruent circles tends to 1 as n tends to infinity.
Graham Ronald L.
Lubachevsky Boris D.
No associations
LandOfFree
Minimum Perimeter Rectangles That Enclose Congruent Non-Overlapping Circles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Minimum Perimeter Rectangles That Enclose Congruent Non-Overlapping Circles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Perimeter Rectangles That Enclose Congruent Non-Overlapping Circles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-543362