Advertisement

Graphs and Combinatorics

, Volume 9, Issue 2–4, pp 365–370 | Cite as

A new proof of laman’s theorem

  • Tiong-Seng Tay
Graphs and Combinatoric

Abstract

We give a simple proof for the characterization of generically rigid bar frameworks in the plane.

Keywords

Tree Decomposition Independent Realization Rigidity Matrix Graph Comb Generic Rigidity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Laman, G.: On graphs and rigidity of plane skeletal structures, J. Eng. Math.4, 331–340 (1970)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Tay, T.S.: Linking(n — 2)-dimensional panels in n-space II:(n — 1,2)-frameworks and body and hinge structures, Graphs Comb.5, 245–273 (1989)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Tay, T.S.: Linking(n — 2)-dimensional panels in n-space I:(k — 1, k)-graphs and(k — 1,k)- frames, Graphs Comb.7, 289–304 (1991)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Tiong-Seng Tay
    • 1
  1. 1.Department of MathematicsNational University of SingaporeSingapore

Personalised recommendations