The one-dimensional circle packing problem is as follows: You have N circles ofradii
Chapter 10, Problem 10.47(choose chapter or problem)
The one-dimensional circle packing problem is as follows: You have N circles ofradii r1,r2, ... ,rN. These circles are packed in a box such that each circle is tangentto the bottom of the box and are arranged in the original order. The problemis to find the width of the minimum-sized box. Figure 10.77 shows an examplewith circles of radii 2, 1, 2 respectively. The minimum-sized box has width4 + 42.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer