Densest Lattice Packings of 3-Polytopes
Metric Geometry
2007-05-23 v1
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.
Cite
@article{arxiv.math/9909172,
title = {Densest Lattice Packings of 3-Polytopes},
author = {Ulrich Betke and Martin Henk},
journal= {arXiv preprint arXiv:math/9909172},
year = {2007}
}
Comments
37 pages