Densest Lattice Packings of 3-Polytopes
Ulrich Betke, Martin Henk
Abstract
Based 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.
Create a lesson
Related papers
The Bézout inequality for mixed volumes characterizes simplices
Dylan Langharst, Shouda Wang
Affine dual Minkowski problem for general measures
Cheng Zhang, Hailin Jin
Algebraically independent distances and rigid metrics
Yoshito Ishiki
On the Geometry of Wasserstein Barycenter II: Riemannian Rigidity, Essential Non-Branching, and Finsler Models
Bang-Xian Han, Deng-Yu Liu
A Weak Topology on Metric Spaces
Armando W. Gutiérrez, Olavi Nevanlinna
Uncentered Blaschke-Santaló inequalities for the Gaussian measure
S. Artstein-Avidan, M. Fradelizi, K. Wyczesany