Densest lattice packings of 3-polytopes.

From MaRDI portal
Publication:2482879




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.









This page was built for publication: Densest lattice packings of 3-polytopes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482879)