Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems

DOI10.1007/978-3-319-21362-0_11zbMath1439.05172arXiv1503.01837OpenAlexW1543767267MaRDI QIDQ3452284

Menghan Wang, Sitharam, Meera

Publication date: 11 November 2015

Published in: Automated Deduction in Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01837

zbMATH Keywords

non-uniform hypergraphdictionary learning problems

Mathematics Subject Classification ID

Hypergraphs (05C65) Finite affine and projective planes (geometric aspects) (51E15)

Related Items (1)

The combinatorial geometry of stresses in frameworks

Cites Work

• Body-and-cad geometric constraint systems
• Slider-pinning rigidity: a Maxwell-Laman-type theorem
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• Sparse hypergraphs and pebble game algorithms
• Symbolic constraints in constructive geometric constraint solving
• An algorithm for two-dimensional rigidity percolation: The pebble game
• ON AFFINE RIGIDITY
• On the number of fundamental fields
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The Algebraic Geometry of Stresses in Frameworks
• The Algebraic Geometry of Motions of Bar-and-Body Frameworks
• The Rigidity of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial Rigidity and Independence of Generalized Pinned Subspace-Incidence Constraint Systems