Densest lattice packings of 3-polytopes.
From MaRDI portal
Publication:2482879
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
Cited in
(20)- Dense crystalline dimer packings of regular tetrahedra
- A dense packing of regular tetrahedra
- Optimal families of two and three-dimensional lattice packings from polynomials with integer coefficients
- Mathematical modeling of the interaction of non-oriented convex polytopes
- Packing, tiling, and covering with tetrahedra
- Packing different cuboids with rotations and spheres into a cuboid
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- Lower bound on the translative covering density of octahedra
- New family of tilings of three-dimensional Euclidean space by tetrahedra and octahedra
- Order metrics and order maps of octahedron packings
- Lattice packing and covering of convex bodies
- New dense superball packings in three dimensions
- A Note on Lattice Packings via Lattice Refinements
- Maximum packing densities of basic 3D objects
- Entropic Trust Region for Densest Crystallographic Symmetry Group Packings
- The densest lattices in \(\mathrm{PGL}_3(\mathbb Q_2)\)
- On lattice coverings by simplices
- On densities of lattice arrangements intersecting every \(i\)-dimensional affine subspace
- On the translative packing densities of tetrahedra and cuboctahedra
- Application of an idea of Voronoĭ to lattice packing
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)