Densest lattice packings of 3-polytopes.

From MaRDI portal
Publication:2482879

DOI10.1016/S0925-7721(00)00007-9zbMATH Open1133.52307arXivmath/9909172WikidataQ56060663 ScholiaQ56060663MaRDI QIDQ2482879FDOQ2482879


Authors: Martin Henk, Ulrich. Betke Edit this on Wikidata


Publication date: 25 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/9909172




Recommendations




Cited In (20)





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)