A characterisation of the generic rigidity of 2-dimensional point-line frameworks
From MaRDI portal
Publication:273172
DOI10.1016/j.jctb.2015.12.007zbMath1338.52021arXiv1407.4675OpenAlexW286270710MaRDI QIDQ273172
Publication date: 21 April 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.4675
submodular functionpolynomial algorithmcount matroidcombinatorial rigidityDilworth truncationmatroid unionpoint-line framework
Related Items
A characterisation of the generic rigidity of 2-dimensional point-line frameworks, Pairing symmetries for Euclidean and spherical frameworks, Point-hyperplane frameworks, slider joints, and rigidity preserving transformations, Stability of Z2 configurations in 3D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- A rooted-forest partition with uniform vertex demand
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- A matroid on hypergraphs, with applications in scene analysis and geometry
- Forests, frames, and games: Algorithms for matroid sums and applications
- An algorithm for two-dimensional rigidity percolation: The pebble game
- Connected rigidity matroids and unique realizations of graphs
- On the determinacy of repetitive structures.
- Geometric constraint solver
- On combinatorial structures of line drawings of polyhedra
- Pebble game algorithms and sparse graphs
- Generic global rigidity
- Submodular functions and independence structures
- On graphs and rigidity of plane skeletal structures
- CONSTRAINTS ON SIMPLE GEOMETRY IN TWO AND THREE DIMENSIONS
- The Union of Matroids and the Rigidity of Frameworks
- On Generic Rigidity in the Plane
- MATROIDS AND SUBMODULAR FUNCTIONS
- The Rigidity of Graphs
- Transversals and matroid partition
- Minimum partition of a matroid into independent subsets
- Algorithms - ESA 2003
- Automated Deduction in Geometry