What Circle Packing Is
Circle packing is a geometric arrangement problem where circles are placed within a confined space without overlapping. This concept has applications in various fields including materials science, computer graphics, and even art.
The RSA (Random Sequential Addition) method involves randomly placing circles one at a time until no more can fit, while the advancing front technique adds circles by finding tangents to existing circles.
Why It Matters
Efficient circle packing is crucial in understanding how particles pack together in materials, which affects properties like density and stability.
The RSA method provides a simple yet effective way to model random particle arrangements, while the advancing front technique offers a more structured approach that can lead to higher packing densities.
RSA vs Advancing Front
Random Sequential Addition (RSA) is known for its simplicity and ease of implementation but often results in lower packing fractions. The RSA method tends to leave significant gaps between circles, as it does not account for the geometric constraints that could lead to higher density packings.
The advancing front algorithm seeks to minimize these gaps by always adding new circles at points where they can tangentially touch existing ones, leading to a more efficient and often closer-to-optimal packing.
Packing Fraction and Theoretical Limits
The true packing fraction is the ratio of the total area occupied by the circles to the total area of the container. In two dimensions, the RSA method typically achieves a packing fraction around 54.7%, which is known as the jamming limit.
For monodisperse circle packings (where all circles have the same radius), the theoretical maximum packing density in two dimensions is achieved by a hexagonal arrangement, giving a packing fraction of approximately 90.69%. The advancing front method can approach this value more closely than RSA.
Frequently asked questions
What does the jamming limit mean for circle packing?
The jamming limit represents the maximum packing density that can be achieved when circles are added randomly, without any specific order or algorithm guiding their placement.
Why is the hexagonal arrangement considered optimal in circle packing?
A hexagonal arrangement minimizes the total perimeter of all circles for a given area, leading to the highest possible packing density among all possible arrangements.
How does polydisperse size mode affect the packing fraction?
In a polydisperse system, where circle sizes vary, the packing fraction can be significantly lower than in monodisperse systems because larger circles may block smaller ones from fitting into optimal positions.
Can the advancing front method always achieve the hexagonal optimum?
While the advancing front method is more likely to approach the hexagonal optimum, it does not guarantee achieving it due to the randomness in the initial placement of circles and other factors.
Try it live
Everything above runs in your browser — open Circle Packing: RSA vs Advancing Front (2D) and change the parameters while it is running. Nothing is installed, nothing is uploaded, the whole model lives in one tab.
▶ Open Circle Packing: RSA vs Advancing Front (2D) simulation