633 citations · 1.8k across the 55 of their papers we have counts for
6 papers · 1 filter
How densely can spheres be packed with moderate effort in high dimensions?
Veit Elser
We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to doubl…
Packing-constrained point coverings
Veit Elser
In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consi…
Upper bound on the packing density of regular tetrahedra and octahedra
Simon Gravel, Veit Elser, Yoav Kallus
We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint sp…
A method for dense packing discovery
Yoav Kallus, Veit Elser, Simon Gravel
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological science…
Dense periodic packings of tetrahedra with small repeating units
Yoav Kallus, Veit Elser, Simon Gravel
We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction , that are simple in the sense that they are transitiv…
Laminating lattices with symmetrical glue
Veit Elser, Simon Gravel
We use the automorphism group , of holes in the lattice , as the starting point in the construction of sphere packings in 10 and 12 dimensions.…