by Betke, Ulrich, Henk, Martin.
Series: 1999-18, Preprints
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.
lattice packings, critical lattice, polytopes