AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an ...
Abstract. One of the basic problems in discrete geometry is to determine the most efficient packing ...
Dedicated to Branko Grunbaum at his 70th birthday Abstract. We prove that for a densest packing of m...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
AbstractThe sphere packing problem asks whether any packing of spheres of equal radius in three dime...
In this thesis we give a new approach to the classical problems of finite and infinite packings and ...
The focus of this thesis lies on geometric packings of non-spherical shapes in three-dimensional Euc...
AbstractThe densest lattice packings of ellipsoids in Euclidian d-space Ed are known for d⩽8. We con...
In this paper we will take a look at sphere packings and we will try to find the highest density bin...
In this thesis, we study different kinds of packing problems. A packing is an arrangement of geometr...
We address the problem of covering ℝ n with congruent balls, while minimizing the number of balls th...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
AbstractBased on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an ...
Abstract. One of the basic problems in discrete geometry is to determine the most efficient packing ...
Dedicated to Branko Grunbaum at his 70th birthday Abstract. We prove that for a densest packing of m...
In this paper we determine new upper bounds for the maximal density of translative packings of super...
AbstractThe sphere packing problem asks whether any packing of spheres of equal radius in three dime...
In this thesis we give a new approach to the classical problems of finite and infinite packings and ...
The focus of this thesis lies on geometric packings of non-spherical shapes in three-dimensional Euc...
AbstractThe densest lattice packings of ellipsoids in Euclidian d-space Ed are known for d⩽8. We con...
In this paper we will take a look at sphere packings and we will try to find the highest density bin...
In this thesis, we study different kinds of packing problems. A packing is an arrangement of geometr...
We address the problem of covering ℝ n with congruent balls, while minimizing the number of balls th...
This document is composed of a series of articles in discrete geometry, each solving a problem in pa...
The sphere packing problem in dimension N asks for an arrangement of non-overlapping spheres of equa...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
AbstractThe critical lattice of the euclidean 3-dimensional space generated by the vertices of a reg...
DOI
Add to ORKG