Related papers: Packing convex bodies by cylinders

The Two-dimensional Bin Packing Problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be rotated and cannot…

We prove several estimates for the volume, mean width, and the value of the Wills functional of sections of convex bodies in John's position, as well as for their polar bodies. These estimates extend some well-known results for convex…

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

In this paper, we show that if $L_p$ Gaussian surface area measure is proportional to the spherical Lebesgue measure, then the corresponding convex body has to be a centered disk when $p\in[0,1)$. Moreover, we investigate $C^0$ estimate of…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

In this note, we estimate the upper bound of volume of closed positively or nonnegatively curved Alexandrov space $X$ with strictly convex boundary. We also discuss the equality case. In particular, the Boundary Conjecture holds when the…

We generalize the ham sandwich theorem for the case of well separated measures. Given convex bodies $K_1,...,K_d$ in $\mathbb{R_d}$ and numbers $\alpha_1,...,\alpha_d \in [0, 1]$, we give a sufficient condition for existence and uniqueness…

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

A centrally symmetric convex body is a convex compact set with non-empty interior that is symmetric about the origin. Of particular interest are those that are both smooth and strictly convex -- known here as regular symmetric bodies --…

We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of…

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

We give the sharp lower bound of the volume product of $n$-dimensional convex bodies which are invariant under a discrete subgroup $SO(K)=\{ g \in SO(n); g(K)=K \}$, where $K$ is an $n$-cube or $n$-simplex. This provides new partial results…

We show that in all dimensions d>2, there exists an asymmetric convex body of revolution all of whose maximal hyperplane sections have the same volume. This gives the negative answer to the question posed by V. Klee in 1969.

We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the x-coordinates of all the rectangles before any of the y-coordinates. We…

A translation body of a convex body is the convex hull of two of its translates intersecting each other. In the 1950s, Rogers and Shephard found the extremal values, over the family of $n$-dimensional convex bodies, of the maximal volume of…

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…