What is the most inefficient to pack convex object?

49 Views Asked by At

Suppose that you have an infinite number of identical $n$-dimensional convex objects. If the objects are packed optimally (so as to minimize the interstitial space), what object would result in the most interstitial space as a proportion of all of $\mathbb{R}^n$?