Producing dense packings of cubes
The problemt of packing a set of \(n\) \(d\)-dimensional congruent cubes into a sphere of smallest radius is considered. An earlier method of the same authors for the \(d\)-dimensional case is adapted and generalized, but used only for \(d= 3\), up to \(n=20\). The main steps of algorithm are: \(\bullet\) Choose randomly \(n\) non-overlapping-cubes inside the unit ball \(K\). \(\bullet\) Move randomly the \(n\) cubes without overlap inside \(K\) and inflate them if it is possible. Continue until the packing is jammed. The approach is based on a function \(\psi\) called the maximal inflation function. In this paper, the efficiency of calculating \(\psi\) is improved.
- Covering a rectangle with equal circles
- Dense packings of congruent circles in a circle
- Dense packings of equal spheres in a cube
- Efficient packing of unit squares in a square
- Geometric properties of random disk packings.
- How to simulate billiards and similar systems
- scientific article; zbMATH DE number 2167050 (Why is no real title available?)
- Improved dense packings of congruent squares in a square
- Improving dense packings of equal disks in a square
- On packing squares with equal squares
- Packing 10 or 11 unit squares in a square
- Packing unit squares in a rectangle
- Packing unit squares in squares: A survey and new results
- Unsolved problems in geometry
- Dense packings of equal spheres in a cube
- On limits of dense packing of equal spheres in a cube
- On the problem of packing spheres in a cube
- Optimal packings of two to four equal circles on any flat torus
- scientific article; zbMATH DE number 3890593 (Why is no real title available?)
- Random sequential packing simulations in three dimensions for aligned cubes
- Optimal packings of up to five equal circles on a square flat torus
This page was built for publication: Producing dense packings of cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519836)
