On Some Problems in the Design of Plane Skeletal Structures

DOI10.1137/0604035zbMath0542.51021OpenAlexW2000915372MaRDI QIDQ3330040

Kōkichi Sugihara

Publication date: 1983

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0604035

zbMATH Keywords

rigiditygeneric independencelinear dependence matroidtwo-dimensional frameworks

Mathematics Subject Classification ID

Composite and mixture properties (74E30) Polyhedra and polytopes; regular figures, division of spaces (51M20) Graph theory (05C99)

Related Items

Augmenting the rigidity of a graph in \(\mathbb R^{2}\), Graph transformations for efficient structural analysis, On combinatorial structures of line drawings of polyhedra, A combinatorial study of the rigidity of planar structures, Detection of structural inconsistency in systems of equations with degrees of freedom and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unifying approach to descriptive geometry and mechanisms
• The rigidity of graphs. II
• Matroid matching and some applications
• The rigidity of certain cabled frameworks and the second-order rigidity of arbitrary triangulated convex surfaces
• When is a bipartite graph a rigid framework?
• On graphs and rigidity of plane skeletal structures
• Bracing Rectangular Frameworks. I
• Tensegrity Frameworks
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• The Rigidity of Graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs