Sparse locally-jammed disk packings
From MaRDI portal
Recommendations
Cites work
- A linear programming algorithm to test for jamming in hard-sphere packings
- Combinatorial geometry and its algorithmic applications. The Alcalá lectures
- Curved hexagonal packings of equal disks in a circle
- Densest packings of eleven congruent circles in a circle
- Geometric analysis for the Metropolis algorithm on Lipschitz domains
- scientific article; zbMATH DE number 3213309 (Why is no real title available?)
- Improving dense packings of equal disks in a square
- Micro-local analysis for the Metropolis algorithm
- Min-type Morse theory for configuration spaces of hard spheres
- Optimal packings of eleven equal circles in an equilateral triangle
- Patterns and structures in disk packings
- Research problems in discrete geometry
- Rigidity of packings
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
Cited in
(10)- Exact results for the jammed state of binary mixtures of superdisks on the plane
- Sparse hard-disk packings and local Markov chains
- Correlation decay for hard spheres via Markov chains
- Discrete configuration spaces of squares and hexagons
- The isostatic conjecture
- Configuration spaces of disks in an infinite strip
- Rigidity of packings
- Configuration spaces of disks in a strip, twisted algebras, persistence, and other stories
- Configuration spaces of circles in the plane
- Disks with special properties of densest packings
This page was built for publication: Sparse locally-jammed disk packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929746)