Based on Minkowski's work on critical lattices of 3-dimensional convex bodi
es 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. (C) 200
0 Elsevier Science B.V. All rights reserved.