Related papers: Pessimal packing shapes
In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…
This is the continuation of the author's ArXiv presentation "On packing of Minkowski balls. I". In section 2 we investigate lattice packings of Minkowski balls and domains. By results of the proof of Minkowski conjecture about the critical…
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
The lower dimensional Busemann-Petty problem asks whether origin-symmetric convex bodies in R^n with smaller volume of all k-dimensional sections necessarily have smaller volume. The answer is negative for k>3. The problem is still open for…
Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…
The smallest three hyperbolic compact arithmetic 5-orbifolds can be derived from two compact Coxeter polytops which are combinatorially simplicial prisms (or complete orthoschemes of degree $d=1$) in the five dimensional hyperbolic space…
We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…
The second and fourth authors have conjectured that a certain hollow tetrahedron $\Delta$ of width $2+\sqrt2$ attains the maximum lattice width among all three-dimensional convex bodies. We here prove a local version of this conjecture:…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some…
We give two new upper bounds on the covering minima of convex bodies, depending on covering minima of certain projections and intersections with linear subspaces. We show one bound to be sharp for direct sums of two convex bodies,…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
This work investigates dense packings of congruent hard infinitesimally--thin circular arcs in the two-dimensional Euclidean space. It focuses on those denotable as major whose subtended angle $\theta \in \left ( \pi, 2\pi \right ]$.…
Packings of regular convex polygons ($n$-gons) that are sufficiently dense have been studied extensively in the context of modeling physical and biological systems as well as discrete and computational geometry. Former results were mainly…
We consider a two-dimensional analogue of Jacobi theta functions and prove that, among all lattices $\Lambda \subset \mathbb{R}^2$ with fixed density, the minimal value is maximized by the hexagonal lattice. This result can be interpreted…
The optimization of shape functionals under convexity, diameter or constant width constraints shows numerical challenges. The support function can be used in order to approximate solutions to such problems by finite dimensional optimization…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
G. Fejes T\'oth posed the following problem: Determine the infimum of the densities of the lattices of closed balls in $\bR^n$ such that each affine $k$-subspace $(0 \le k \le n-1)$ of $\bR^n$ intersects some ball of the lattice. We give a…
The random sequential adsorption of various particle shapes is studied in order to determine the influence of particle anisotropy on the saturated random packing. For all tested particles there is an optimal level of anisotropy which…