On Some Problems in the Design of Plane Skeletal Structures

DOI10.1137/0604035MaRDI QIDQ3330040zbMATH OpenOpenAlexFDO

Authors K. 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

generic independencelinear dependence matroidrigiditytwo-dimensional frameworks

Mathematics Subject Classification ID

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

Recommendations

• The Union of Matroids and the Rigidity of Frameworks
• Abstract and generic rigidity in the plane
• Applications of combinatorics to statics -- rigidity of grids
• scientific article; zbMATH DE number 3860448
• Rigidity theory for matroids

Cites work

• A unifying approach to descriptive geometry and mechanisms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• Bracing Rectangular Frameworks. I
• scientific article; zbMATH DE number 1670508 (Why is no real title available?)
• scientific article; zbMATH DE number 3848132 (Why is no real title available?)
• scientific article; zbMATH DE number 3750964 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Matroid matching and some applications
• On graphs and rigidity of plane skeletal structures
• Tensegrity Frameworks
• The rigidity of certain cabled frameworks and the second-order rigidity of arbitrary triangulated convex surfaces
• The Rigidity of Graphs
• The rigidity of graphs. II
• When is a bipartite graph a rigid framework?

Cited in

(25)

• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
• Structural rigidity. II: Almost infinitesimally rigid bar frameworks
• A matroid on hypergraphs, with applications in scene analysis and geometry
• Graph transformations for efficient structural analysis
• Graded sparse graphs and body-length-direction frameworks
• On combinatorial structures of line drawings of polyhedra
• Radically solvable graphs
• Counting on frameworks. Mathematics to aid the design of rigid structures
• Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
• Subspace arrangements, graph rigidity and derandomization through submodular optimization
• scientific article; zbMATH DE number 3853891 (Why is no real title available?)
• scientific article; zbMATH DE number 3860448 (Why is no real title available?)
• scientific article; zbMATH DE number 4209705 (Why is no real title available?)
• Tessellation-like rod-joint frameworks
• The Union of Matroids and the Rigidity of Frameworks
• scientific article; zbMATH DE number 30657 (Why is no real title available?)
• scientific article; zbMATH DE number 67319 (Why is no real title available?)
• Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
• Geometric sensitivity of rigid graphs
• A combinatorial study of the rigidity of planar structures
• The rigidity of generalized rectangular frameworks
• Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
• Applications of combinatorics to statics -- rigidity of grids
• A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
• Rigidity theory for matroids

This page was built for publication: On Some Problems in the Design of Plane Skeletal Structures

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