Patterns and structures in disk packings
The authors investigate structures of packings of \(n\) circular discs in regions of various shapes. The packings are generated by a computational procedure. First random packings are obtained by a billiards simulation algorithm in a square with periodic boundary where the values of \(n\) are in thousands. The initial disc configuration in packings of second type is not random. The experiment begins with a known or conjectured optimal disc configuration. A so-called ``frustration is introduced by varying of boundary shape or disc size. These two types of packings have applications in material science and physics. In the third case the billiards algorithm is applied for small number of discs (from several tens to few hundreds) in circles, squares and equilateral triangles to construct dense packings.
- Repeated patterns of dense packings of equal disks in a square
- Packing densities of patterns
- Disks with special properties of densest packings
- Pattern formations and optimal packing
- Disks vs. spheres: Contrasting properties of random packings
- Geometric properties of random disk packings.
- scientific article; zbMATH DE number 4005052
- scientific article; zbMATH DE number 3884883
- Dense packing of patterns in a permutation
- A method for finding the densest lattice k-fold packing of disks
- On the packing of fourteen congruent spheres in a cube
- Disks vs. spheres: Contrasting properties of random packings
- Sparse locally-jammed disk packings
- Geometric properties of random disk packings.
- Optimal packings of two to four equal circles on any flat torus
- Dense packing of patterns in a permutation
- Pattern formations and optimal packing
- scientific article; zbMATH DE number 3913144 (Why is no real title available?)
- scientific article; zbMATH DE number 4005052 (Why is no real title available?)
- Optimal packings of up to six equal circles on a triangular flat torus
- Disc packings: a probabilistic approach to a geometric problem
- Packing, covering and tiling in two-dimensional spaces
- On covering the square flat torus by congruent discs
- Gaps in the spectrum of two-dimensional square packing of stiff disks
- Optimal packings of up to five equal circles on a square flat torus
- Uniquely optimal codes of low complexity are symmetric
- Packings of circular discs. How a probabilistic perspective can complete a geometric analysis
This page was built for publication: Patterns and structures in disk packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382391)