Densest lattice packings of 3-polytopes.

DOI10.1016/S0925-7721(00)00007-9MaRDI QIDQ2482879zbMATH OpenWikidataFDO

Authors Martin Henk, Ulrich. Betke

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

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.

Recommendations

• Lattices of optimal finite lattice packings
• scientific article; zbMATH DE number 66687
• Dense packing of space with various convex solids
• On large lattice packings of spheres
• Densest translational lattice packing of non-convex polygons

Cited in

(22)

• Order metrics and order maps of octahedron packings
• On lattice coverings by simplices
• Packing different cuboids with rotations and spheres into a cuboid
• Mathematical modeling of the interaction of non-oriented convex polytopes
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace
• On the translative packing densities of tetrahedra and cuboctahedra
• New dense superball packings in three dimensions
• The densest lattices in \(\mathrm{PGL}_3(\mathbb Q_2)\)
• New family of tilings of three-dimensional Euclidean space by tetrahedra and octahedra
• A Note on Lattice Packings via Lattice Refinements
• Packing, tiling, and covering with tetrahedra
• Optimal families of two and three-dimensional lattice packings from polynomials with integer coefficients
• Dense crystalline dimer packings of regular tetrahedra
• Entropic Trust Region for Densest Crystallographic Symmetry Group Packings
• Lower bound on the translative covering density of octahedra
• A design criterion for the Rayleigh fading wiretap channel based on ^1-norm theta functions
• The simultaneous lattice packing-covering constant of octahedra
• Maximum packing densities of basic 3D objects
• Lattice packing and covering of convex bodies
• Application of an idea of Voronoĭ to lattice packing
• A dense packing of regular tetrahedra

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)