Geometric packing problems involve arranging objects of given shapes within a confined region so as to maximise density, minimise wasted space or satisfy prescribed distance and balance constraints.

Have you ever wondered about the best way to pack a finite number of identical spheres into a shape-shifting flexible container, like a convex hull? An intuitively simple problem concerning the best ...