Abstract
We prove that all planar Laman graphs (i.e. minimally generically rigid graphs with a non-crossing planar embedding) can be generated from a single edge by a sequence of vertex splits. It has been shown recently [6,12] that a graph has a pointed pseudo-triangular embedding if and only if it is a planar Laman graph. Due to this connection, our result gives a new tool for attacking problems in the area of pseudo-triangulations and related geometric objects. One advantage of vertex splitting over alternate constructions, such as edge-splitting, is that vertex splitting is geometrically more local.
We also give new inductive constructions for duals of planar Laman graphs and for planar generically rigid graphs containing a unique rigidity circuit. Our constructions can be found in O(n 3) time, which matches the best running time bound that has been achieved for other inductive contructions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berg, A., Jordán, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 78–89. Springer, Heidelberg (2003)
Berg, A., Jordán, T.: A proof of Connelly’s conjecture on 3-connected circuits of the rigidity matroid. J. Combinatorial Theory, Ser. B 88, 77–97 (2003)
Chavez, L., Moshe, L., Whiteley, W.: Bases and circuits for 2-rigidity: constructions via tree coverings, preprint, Department of Mathematics and Statistics, York University (2003)
Gabow, H.N., Westermann, H.H.: Forests, frames and games: Algorithms for matroid sums and applications. Algorithmica 7, 465–497 (1992)
Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. AMS Graduate Studies in Mathematics 2 (1993)
Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudotriangulations. In: Proc. 19th ACM Symposium on Computational Geometry, pp. 154–163 (2003), Journal version to appear in Computational Geometry, Theory and Applications, http://www.arxiv.org/abs/math.CO/0307347
Hendrickson, B.: Conditions for unique graph realizations. SIAM J. Comput. 21(1), 65–84 (1992)
Jackson, B., Jordán, T.: Connected rigidity matroids and unique realizations of graphs, EGRES Technical Report 2002-12, http://www.cs.elte.hu/egres/ ; to appear in J. Combin. Theory Ser. B.
Laman, G.: On graphs and rigidity of plane skeletal structures. J. Engineering Math. 4, 331–340 (1970)
Lovász, L., Yemini, Y.: On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods 3(1), 91–98 (1982)
Orden, D., Santos, F., Servatius, B., Servatius, H.: Combinatorial Pseudo Triangulations, preprint, arXiv:math.CO/0307370v1 (2003)
Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: Proc. 41st FOCS, Redondo Beach, California, pp. 443–453 (2000)
Streinu, I.: Combinatorial roadmaps in configuration spaces of simple planar polygons. In: Basu, S., Gonzalez-Vega, L. (eds.) Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, pp. 181–206 (2003)
Tay, T.S., Whiteley, W.: Generating isostatic frameworks. Structural Topology 11, 21–69 (1985)
Whiteley, W.: Vertex splitting in isostatic Frameworks. Structural Topology 16, 23–30 (1991)
Whiteley, W.: Some matroids from discrete applied geometry. In: Matroid theory, Seattle, WA, 1995. Contemp. Math., vol. 197, pp. 171–311. Amer. Math. Soc., Providence (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fekete, Z., Jordán, T., Whiteley, W. (2004). An Inductive Construction for Plane Laman Graphs via Vertex Splitting. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive