The densest known packing of 15 congruent circles on a sphere occurs in two equally dense varieties. Previously, this was the only known example of a ‘best’ packing of n circles on a sphere with multiplicity greater than one. We present three new examples: n=62, 76 and 117. We discuss these and related examples as manifestations of symmetry breaking involving structures we call “rotational toggle hexagons”. Additionally, we present exact data for n=15, and observe that both the hexagonal packing of the plane and the icosahedral packing of 12 circles on a sphere arise as limiting cases from toggle hexagons
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hendecagon...
The classical circle packing problem asks for an arrangement of non-overlapping circles in the plan...
Packing problems have been of great interest in many diverse contexts for many centuries. The optima...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
In this dissertation we discuss a variety of geometric constraint satisfaction problems. The greates...
In this dissertation we discuss a variety of geometric constraint satisfaction problems. The greates...
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and m...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres ins...
We report the dense configurations of 2 ≤ N ≤ 400 congruent disks packed inside a regular hexagon ob...
Part of Hilbert's eighteenth problem is to classify the symmetries of the densest packings of bodies...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hendecagon...
The classical circle packing problem asks for an arrangement of non-overlapping circles in the plan...
Packing problems have been of great interest in many diverse contexts for many centuries. The optima...
In the Euclidean plane one can pack the unit circles in such a way that every circle touches the max...
Abstract. The densest packings of n congruent circles in a circle are known for n ≤ 12 and n = 19. I...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
In this dissertation we discuss a variety of geometric constraint satisfaction problems. The greates...
In this dissertation we discuss a variety of geometric constraint satisfaction problems. The greates...
Packings of hard polyhedra have been studied for centuries due to their mathematical aesthetic and m...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hexadecago...
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres ins...
We report the dense configurations of 2 ≤ N ≤ 400 congruent disks packed inside a regular hexagon ob...
Part of Hilbert's eighteenth problem is to classify the symmetries of the densest packings of bodies...
We report the dense configurations of 2 ≤ N ≤ 200 congruent disks packed inside a regular hendecagon...
The classical circle packing problem asks for an arrangement of non-overlapping circles in the plan...
Packing problems have been of great interest in many diverse contexts for many centuries. The optima...