2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/79166Based 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.37 pagesMetric Geometry52C17;11H06;68U05text