Densest Lattice Packings of 3-Polytopes

Simple item page
dc.creatorBetke, Ulrich
dc.creatorHenk, Martin
dc.date1999-09-29
dc.date.accessioned2026-07-07T05:30:56Z
dc.date.available2026-07-07T05:30:56Z
dc.descriptionBased 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.
dc.description37 pages
dc.identifierhttps://arxiv.org/abs/math/9909172
dc.identifierhttp://arxiv.org/abs/math/9909172
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79166
dc.subjectMetric Geometry
dc.subject52C17;11H06;68U05
dc.titleDensest Lattice Packings of 3-Polytopes
dc.typetext

Files

Collections

arXiv