Rigidity for sticky discs

DOI10.1098/RSPA.2018.0773MaRDI QIDQ5160632zbMATH OpenOpenAlexWikidataFDO

Authors Robert Connelly, Steven J. Gortler, Louis Theran

Publication date 29 October 2021

Published in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.02006, http://europepmc.org/articles/pmc6405455

zbMATH Keywords

circle packingsjammingrigidity

Mathematics Subject Classification ID

Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Circle packings and discrete conformal geometry (52C26)

Abstract: We study the combinatorial and rigidity properties of disk packings with generic radii. We show that a packing of $n$ disks in the plane with generic radii cannot have more than $2n-3$ pairs of disks in contact. The allowed motions of a packing preserve the disjointness of the disk interiors and tangency between pairs already in contact (modeling a collection of sticky disks). We show that if a packing has generic radii, then the allowed motions are all rigid body motions if and only if the packing has exactly $2n-3$ contacts. Our approach is to study the space of packings with a fixed contact graph. The main technical step is to show that this space is a smooth manifold, which is done via a connection to the Cauchy-Alexandrov stress lemma. Our methods also apply to jamming problems, in which contacts are allowed to break during a motion. We give a simple proof of a finite variant of a recent result of Connelly, et al. on the number of contacts in a jammed packing of disks with generic radii.

Recommendations

• Rigidity in solids
• Rigidity in dynamics
• Stability of disk motion on the rheological ground
• On the rigidity of a class of glued surfaces
• On the stickiness property
• scientific article; zbMATH DE number 480232
• Rigidity versus flexibility for tight confoliations
• scientific article; zbMATH DE number 4200165
• The mechanism of stiffness increase phenomenon of a rubbing disk
• Adhesion of elastic spheres

Cites work

• A linear programming algorithm to test for jamming in hard-sphere packings
• A proof of the molecular conjecture
• Algorithm 990: Efficient atlasing and search of configuration spaces of point-sets constrained by distance intervals
• Algorithms for graph rigidity and scene analysis
• Algorithms in real algebraic geometry
• Almost all circle polyhedra are rigid
• An algorithm for two-dimensional rigidity percolation: The pebble game
• Colloidal matter: Packing, geometry, and entropy
• Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
• Convex Polyhedra
• Forests, frames, and games: Algorithms for matroid sums and applications
• scientific article; zbMATH DE number 3859878 (Why is no real title available?)
• scientific article; zbMATH DE number 4046538 (Why is no real title available?)
• scientific article; zbMATH DE number 3493472 (Why is no real title available?)
• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 3562121 (Why is no real title available?)
• scientific article; zbMATH DE number 1201576 (Why is no real title available?)
• scientific article; zbMATH DE number 817406 (Why is no real title available?)
• Inversive distance
• Isothermic triangulated surfaces
• Local rigidity of inversive distance circle packing
• On graphs and rigidity of plane skeletal structures
• Projective background of the infinitesimal rigidity of frameworks
• Rigidity of packings
• Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
• The Algebraic Geometry of Stresses in Frameworks
• The frictional pebble game: an algorithm for rigidity percolation in saturated frictional assemblies
• The isostatic conjecture
• The Rigidity of Graphs

Cited in

(10)

• Homothetic packings of centrally symmetric convex bodies
• The isostatic conjecture
• Jamming and geometric representations of graphs
• Rigidity of packings
• Packing disks by flipping and flowing
• Open mushrooms: stickiness revisited
• How many contacts can exist between oriented squares of various sizes?
• Generalizing Andreev's theorem via circle patterns
• Rigidity of circle packings with flexible radii
• Single-cell 3D genome reconstruction in the haploid setting using rigidity theory

This page was built for publication: Rigidity for sticky discs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160632)