Globally rigid circuits of the direction-length rigidity matroid

Journal of Combinatorial Theory. Series B

Volumn 100, Issue 1, 2010, Pages 1-22

  Jackson, Bill ^a   Jordán, Tibor ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

Direction and length constraints; Globally rigid graphs; Rigidity matroid

Indexed keywords

EID: 71549120397     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2009.03.004     Document Type: Article

References (19)

1. Berg A.R., and Jordán T. A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. J. Combin. Theory Ser. B 88 (2003) 77-97
2. Berg A.R., and Jordán T. Algorithms for graph rigidity and scene analysis. In: Di Battista G., and Zwick U. (Eds). Proc. 11th Annual European Symposium on Algorithms (ESA) 2003. Lecture Notes in Comput. Sci. vol. 2832 (2003), Springer 78-89
3. Connelly R. On generic global rigidity. Applied Geometry and Discrete Mathematics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 4 (1991), Amer. Math. Soc., Providence, RI 147-155
4. Connelly R. Generic global rigidity. Discrete Comput. Geom. 33 4 (2005) 549-563
5. T. Eren, W. Whiteley, A.S. Morse, P.N. Belhumeur, B.D.O. 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, 2003, pp. 3064-3069
6. Gabow H.N. Algorithms for graphic polymatroids and parametric over(s, -)-sets. J. Algorithms 26 1 (1998) 48-86
7. Gortler S.J., Healy A.D., and Thurston D.P. Characterizing generic global rigidity (2007). arXiv:0710.0926v3
8. Graver J., Servatius B., and Servatius H. Combinatorial Rigidity. Grad. Stud. Math. vol. 2 (1993), Amer. Math. Soc.
9. Hendrickson B. Conditions for unique graph realizations. SIAM J. Comput. 21 1 (1992) 65-84
10. Hendrickson B. The molecule problem: Exploiting structure in global optimization. SIAM J. Optim. 5 4 (1995) 835-857
11. Hopcroft J.E., and Tarjan R.E. Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135-158
12. Jackson B., and Jordán T. Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory Ser. B 94 (2005) 1-29
13. B. Jackson, T. Jordán, Operations preserving global rigidity of generic direction-length frameworks, submitted for publication; see also Egerváry Research Group TR-2008-08 at www.cs.elte.hu/egres/
14. Jackson B., Jordán T., and Szabadka Z. Globally linked pairs of vertices in equivalent realizations of graphs. Discrete Comput. Geom. 35 (2006) 493-512
15. Laman G. On graphs and rigidity of plane skeletal structures. J. Engrg. Math. 4 (1970) 331-340
16. Lovász L., and Yemini Y. On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods 3 1 (1982) 91-98
17. J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, Tech. Report, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA, 1979
18. Servatius B., and Whiteley W. Constraining plane configurations in CAD: Combinatorics of directions and lengths. SIAM J. Discrete Math. 12 (1999) 136-153
19. Whiteley W. Some matroids from discrete applied geometry. Matroid Theory. Seattle, WA, 1995. Contemp. Math. vol. 197 (1996), Amer. Math. Soc., Providence, RI 171-311