Combinatorial genericity and minimal rigidity

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2008, Pages 365-374

  Streinu, Ileana ^a,b   Theran, Louis ^a,b  

^a SMITH COLLEGE   (United States)

^b University of Massachusetts Amherst   (United States)

Author keywords

Computational geometry; Rigidity; Sparse graphs

Indexed keywords

COMBINATORIAL PROOFS; DECISION ALGORITHMS; EUCLIDEAN; FINITE SETS; GENERIC POINTS; GENERICITY; GEOMETRIC PROBLEMS; NP-HARD; PAIRWISE DISTANCES; POINT SETS; SPARSE GRAPHS; STRUCTURE DETERMINATIONS; UNDERLYING GRAPHS;

COMBINATORIAL MATHEMATICS; DECISION THEORY; FORMAL LOGIC; QUANTUM CHEMISTRY; RESTORATION; RIGIDITY; SENSOR NETWORKS; SET THEORY;

COMPUTATIONAL GEOMETRY;

EID: 57349165747     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377738     Document Type: Conference Paper

References (37)

1. A. C. Aitken. Determinants and Matrices. Oliver and Boyd, Edinburgh, 1948.
2. L. Asimow and B. Roth. The rigidity of graphs. Transactions of the American Mathematical Society, 245:279-289, November 1978.
3. S. Bereg. Faster algorithms for rigidity in the plane. http://arxiv.org/abs/0711.2835, 2007.
4. H. H. Crapo. On the generic rigidity of plane frameworks. Technical Report 1278, Institut de recherche d'informatique et d'automatique, 1988.
5. G. M. Crippen and T. F. Havel. Distance Geometry and Molecular Conformation. John Wiley and Research Studies Press, Somerset, England, 1988.
6. O. Daescu and A. Kurdia. Recognizing minimally rigid graphs in the plane in subquadratic time. In The Proceedings of the 17th Fall Workshop on Computational and Combinatorial Geometry (FWCG '07), 2007. http://linkage.cs.umass.edu/fwcg2007/Proceedings/submission-25.pdf.
7. Z. Fekete. Source location with rigidity and tree packing requirements. Operations Research Letters, 34(6):607-612, November 2006.
8. H. Gabow and H. H. Westermann. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica, 7(1):465-497, December 1992.
9. I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky. Discriminants, Resultants and Multidimensional Determinants. Birkhauser, Boston, 1994.
10. H. Gluck. Almost all simply connected closed surfaces are rigid. Lecture Notes in Matehmatics, 438:225-239, 1975.
11. J. Graver, B. Servatius, and H. Servatius. Combinatorial rigidity, volume 2 of Graduate Studies in Mathematics. American Mathematical Society, November 1993.
12. R. Haas. Characterizations of arboricity of graphs. Ars Combinatorica, 63:129-137, 2002.
13. R. Haas, A. Lee, I. Streinu, and L. Theran. Characterizing sparse graphs by map decompositions. Journal of Combinatorial Mathematics and Combinatorial Computing, 62:3-11, 2007.
14. L. Henneberg. Die graphische statik der starren systeme. Johnson Reprint 1968. Leipzig, 1911.
15. D. J. Jacobs and B. Hendrickson. An algorithm for two-dimensional rigidity percolation: the pebble game. Journal of Computational Physics, 137:346-365, November 1997.
16. G. Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4:331-340, 1970.
17. A. Lee and I. Streinu. Pebble game algorithms and sparse graphs. Discrete Mathematics, 2007. http://dx.doi.org/10.1016/j.disc.2007.07.104.
18. A. Lee, I. Streinu, and L. Theran. Finding and maintaining rigid components. In Proceeding of the Canadian Conference of Computational Geometry. Windsor, Ontario, 2005. http://cccg.cs.uwindsor.ca/papers/72.pdf.
19. A. Lee, I. Streinu, and L. Theran. Graded sparse graphs and matroids. Journal of Universal Computer Science, 13(10), 2007.
20. A. Lee, I. Streinu, and L. Theran. The slider-pinning problem. In Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG'07), 2007.
21. L. Lovász and M. D. Plummer. Matching Theory, volume 29 of Annals of Discrete Mathematics. North Holland, 1986.
22. L. Lovász and Y. Yemini. On generic rigidity in the plane. SIAM J. Algebraic and Discrete Methods, 3(1):91-98, 1982.
23. L. Lovász. The matroid matching problem. Algebraic methods in graph theory, 25:495-517, 1978.
24. L. Lovász. Matroid matching and some applications. Journal of Combinatorial Theory, Series (B), 28:208-236, 1980.
25. J. C. Maxwell, On the calculation of the equilibrium and stiffness of frames. Philos. Mag., 27:294, 1864.
26. C. S. A. Nash-Williams. Decomposition of finite graphs into forests. Journal London Mathematical Society, 39:12, 1964.
27. J. G. Oxley. Matroid theory. The Clarendon Press Oxford University Press, New York, 1992.
28. A. Recski. A network theory approach to the rigidity of skeletal structures II. Laman's theorem and topological formulae. Discrete Applied Math, 8:63-68, 1984.
29. J. B. Saxe. Embeddability of weighted graphs in k-space is strongly np-hard. In Proc. of 17th Allerion Conference in Communications, Control, and Computing, pages 480-489, Monticello, IL, 1979.
30. A. M.-C. So and Y. Ye. Theory of semidefinite programming for sensor network localization. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 405-414, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
31. I. Streinu and L. Theran. Combinatorial genericity and minimal rigidity, 2007, http://arxiv.org/abs/0712.0031.
32. I. Streinu and L. Theran. Sparsity-certifying graph decompositions, http://arxiv.org/abs/0704.0002, 2007.
33. T.-S. Tay. A new proof of Laman's theorem. Graphs and Combinatorics, 9:365-370, 1993.
34. W. T. Tutte. On the problem of decomposing a graph into n connected factors. Journal London Math. Soc., 142:221-230, 1961.
35. W. Whiteley. The union of matroids and the rigidity of frameworks. SIAM Journal Discrete Mathematics, 1(2):237-255, May 1988.
36. W. Whiteley. Some matroids from discrete applied geometry. In J. Bonin, J. G. Oxley, and B. Servatius, editors, Matroid Theory, volume 197 of Contemporary Mathematics, pages 171-311. American Mathematical Society, 1996.
37. 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, Boca Raton New York, 2004.