Sergey Bereg
ABSTRACT
We study minimally rigid graphs in the plane or plane isostatic graphs. These graphs (also called Laman graphs) admit characterizations based on decomposition into trees (Crapo's theorem and Récski's theorem). Tree partitions can be viewed as certificates of plane isostatic graphs. Unfortunately, they require Ω(n2) time to verify their validity where n is the number of vertices in the graph. We present a new construction (which can be viewed as a hierarchical decomposition of the graph) called red-black hierarchy that (i) is a certificate for plane isostatic graphs, and (ii) can be verified in linear time. We also show that it can be computed in O(n2) time.A classical result in Rigidity Theory by Henneberg [9] states that the plane isostatic graphs can be constructed incrementally by special vertex insertions. We study the following computational problem: given a Laman graph G, compute a sequence of Henneberg insertions that yields G. We show that the red-bl ack hierarchy can be used to compute a Henneberg construction in O(n2) time. Applied to planar graphs our algorithm can speed up a recent algorithm by Haas et al. [8] for embedding a planar Laman graph as a pointed pseudo-triangulation by a factor of O(n).
- A. R. Berg and T. Jordan. Algorithms for graph rigidity and scene analysis. In 11th European Symp. on Algorithms, LNCS 2832, pages 78--89. Springer-Verlag, 2003.Google Scholar
Cross Ref
- R. Connelly, E. D. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41th Annu. Sympos. on Found. of Computer Science, pages 432--442, 2000. Google ScholarDigital Library
- T. Eren, B. D. Anderson, W. Whiteley, A. S. Morse, and P. N. Belhumeur. Information structures to control formation splitting and merging. In Proc. of the American Control Conference, 2004.Google ScholarCross Ref
- T. Eren, P. N. Belhumeur, and A. S. Morse. Closing ranks in vehicle formations based on rigidity. In Proc. 41st Conference on Decision and Control, volume 3, pages 2959--2964, 2002.Google ScholarCross Ref
- T. Eren, W. Whiteley, A. S. Morse, P. N. Belhumeur, and B. D. Anderson. Sensor and network topologies of formations with direction, bearing and angle information between agents. In Proc. of the 42nd IEEE Conference on Decision and Control, pages 3064--3069, 2003.Google ScholarCross Ref
- J. Graver, B. Servatius, and H. Servatius. Combinatorial Rigidity, volume 2. Amer. Math. Soc., Graduate Studies in Mathematics, 1993.Google Scholar
- L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graph., 4(2):74--123, Apr. 1985. Google ScholarDigital Library
- R. Haas, D. Orden, G. Rote, F. Santos, B. Servatius, H. Servatius, I. Streinu, D. Souvaine, and W. Whiteley. Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. Theory Appl., 31(1-2):31--61, 2005. Google ScholarDigital Library
- L. Henneberg. Die graphische Statik der starren Systeme. Leipzig, 1911.Google Scholar
- J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549--568, 1974. Google ScholarDigital Library
- D. Jacobs, A. J. Rader, L. Kuhn, and M. Thorpe. Protein flexibility predictions using graph theory. Proteins, 44:150--165, 2001.Google ScholarCross Ref
- D. J. Jacobs and B. Hendrickson. An algorithm for two dimensional rigidity percolation: The pebble game. J. Comp. Phys., 137(2):346--365, 1997. Google ScholarDigital Library
- G. Laman. On graphs and rigidity of plane skeletal structures. J. Engineering Math., 4:331--340, 1970.Google ScholarCross Ref
- L. Lovasz and Y. Yemini. On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods, 3:91--98, 1982.Google ScholarDigital Library
- I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci., pages 443--453, 2000. Google ScholarDigital Library
- K. Sugihara. Machine Interpretation of Line Drawings. MIT Press Series in Artificial Intelligence. MIT Press, 1986. Google ScholarDigital Library
- W. Whiteley. Rigidity of molecular structures: generic and geometric analysis. In M. F. Thorpe and P. M. Duxbury, editors, Rigidity Theory and Applications, pages 21--46. Kluwer, 1999.Google Scholar
- W. Whiteley. Rigidity and scene analysis. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 60, pages 1327--1354. CRC Press LLC, Boca Raton, FL, 2004. Google ScholarDigital Library
Index Terms
- Certifying and constructing minimally rigid graphs in the plane
Recommendations
Planar minimally rigid graphs and pseudo-triangulations
SCG '03: Proceedings of the nineteenth annual symposium on Computational geometryPointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (incident to an angle larger than p). In this paper we prove that the opposite statement is also true, namely that planar minimally rigid graphs ...
On minimally b-imperfect graphs
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbour in all other color classes. The b-chromatic number of a graph G is the largest integer k such that G admits a b-coloring with k ...
Minimally contraction-critically 6-connected graphs
An edge of a 6-connected graph is said to be removable (resp. contractible) if the removal (resp. contraction) of the edge results in a 6-connected graph. A 6-connected graph is said to be minimally contraction-critically 6-connected if it has neither ...
Comments