Certifying and constructing minimally rigid graphs in the plane

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 73-80

  Bereg, Sergey ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Computational geometry; Henneberg construction; Pseudo triangulation; Rigidity theory; Tree decomposition

Indexed keywords

COMPUTATIONAL GEOMETRY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

HENNEBERG CONSTRUCTION; PSEUDO-TRIANGULATION; RIGIDITY THEORY; TREE DECOMPOSITION;

GRAPH THEORY;

EID: 33244482824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064106     Document Type: Conference Paper

References (18)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. J. Graver, B. Servatius, and H. Servatius. Combinatorial Rigidity, volume 2. Amer. Math. Soc., Graduate Studies in Mathematics, 1993.
7. 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.
8. 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.
9. L. Henneberg. Die graphische Statik der starren Systeme. Leipzig, 1911.
10. J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549-568, 1974.
11. D. Jacobs, A. J. Rader, L. Kuhn, and M. Thorpe. Protein flexibility predictions using graph theory. Proteins, 44:150-165, 2001.
12. D. J. Jacobs and B. Hendrickson. An algorithm for two dimensional rigidity percolation: The pebble game. J. Comp. Phys., 137(2):346-365, 1997.
13. G. Laman. On graphs and rigidity of plane skeletal structures. J. Engineering Math., 4:331-340, 1970.
14. L. Lovasz and Y. Yemini. On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods, 3:91-98, 1982.
15. 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.
16. K. Sugihara. Machine Interpretation of Line Drawings. MIT Press Series in Artificial Intelligence. MIT Press, 1986.
17. 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.
18. 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.