Skip to main content
Log in

Rigid Two-Dimensional Frameworks with Three Collinear Points

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let G = (V, E) be a graph and x, y, zV be three designated vertices. We give a necessary and sufficient condition for the existence of a rigid two-dimensional framework (G, p), in which x, y, z are collinear. This result extends a classical result of Laman on the existence of a rigid framework on G. Our proof leads to an efficient algorithm which can test whether G satisfies the condition.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berg, A.R., Jordán, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds) Proceedings 11th annual european symposium on algorithms (ESA) 2003, Springer lecture notes in computer science 2832, 2003, pp. 78–89

  2. Bolker, E.D., Roth, B.: When is a bipartite graph a rigid framework? Pacific J. Math. 90, 27–44 (1980)

    Google Scholar 

  3. Crapo, H., Whiteley, W.: Statics of frameworks and motions of panel structures, a projective geometric introduction. Shape Structural Topology 6, 43–82 (1982)

    Google Scholar 

  4. Gluck, H.: Almost all simply connected closed surfaces are rigid. In: Geometric Topology Proceedings of the Conference, Park City, Utah, 1974, Lecture Notes in Mathematics, vol. 438, Springer, Berlin, 1975, pp. 225–239

  5. Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity, AMS Graduate Studies in Mathematics Vol. 2, 1993

  6. Henneberg, L.: Die graphische Statik der starren Systeme, Leipzig, 1911

  7. Jackson, B., Jordán, T.: Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory Ser. B. 94, 1–29 (2005)

    Google Scholar 

  8. Laman, G.: On graphs and rigidity of plane skeletal structures. J. Engineering Math. 4, 331–340 (1970)

    Google Scholar 

  9. Lovász, L., Yemini, Y.: On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods 3(1), 91–98 (1982)

    Google Scholar 

  10. Oxley, J.G.: Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1992, xii+532

  11. Tay, T.S., Whiteley, W.: Generating isostatic frameworks. Structural Topology 11, 21–69 (1985)

    Google Scholar 

  12. White, N.L., Whiteley, W.: The algebraic geometry of stresses in frameworks. SIAM J. Alg. Disc. Meth. 4, 481–511 (1983)

    Google Scholar 

  13. Whiteley, W.: Infinitesimal motions of bipartite frameworks. Pacific J. Math. 110, 233–255 (1984)

    Google Scholar 

  14. Whiteley, W.: Some matroids from discrete applied geometry. Matroid theory (Seattle, WA, 1995), pp. 171–311; Contemp. Math., 197, Am. Math. Soc., Providence, RI, 1996

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tibor Jordán.

Additional information

Supported by the MTA-ELTE Egerváry Research Group on Combinatorial Optimization, and the Hungarian Scientific Research Fund grant no. F034930, T037547, and FKFP grant no. 0143/2001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jackson, B., Jordán, T. Rigid Two-Dimensional Frameworks with Three Collinear Points. Graphs and Combinatorics 21, 427–444 (2005). https://doi.org/10.1007/s00373-005-0629-9

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0629-9

Keywords

Navigation