The slider-pinning problem

CCCG 2007 - 19th Canadian Conference on Computational Geometry

Volumn , Issue , 2007, Pages 113-116

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

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TIME ALGORITHMS;

DEGREES OF FREEDOM (MECHANICS); MECHANICS;

COMPUTATIONAL GEOMETRY;

EID: 84893425830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. A. R. Berg and T. Jordán. Algorithms for graph rigidity and scene analysis. In G. D. Battista and U. Zwick, editors, ESA, Volume 2832 of Lecture Notes in Computer Science. Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, Springer, 2003.
2. H. Crapo. On the generic rigidity of plane frameworks. Technical Report 1278, Institut de recherche d'informatique et d'automatique, 1988.
3. Z. Fekete. Source location with rigidity and tree packing requirements. TR 2005-04, Egerváry Research Group, Eötvös University, Budapest, 2005.
4. 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.
5. G. Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4:331-340, 1970.
6. A. Lee and I. Streinu. Pebble game algorithms and sparse graphs. Discrete Mathematics, 2007. http://arxiv.org/abs/math.CO/0702129.
7. A. Lee, I. Streinu, and L. Theran. Finding and maintaining rigid components. In Proceeding of the Canadian Conference of Computational Geometry. Windsor, Ontario, 2005.
8. A. Lee, I. Streinu, and L. Theran. Pinning laman mechanisms with sliders. Manuscript, 2007.
9. L. Lovász. The matroid matching problem. Algebraic methods in graph theory, 25:495-517, 1978.
10. L. Lovász. Matroid matching and some applications. Journal of Combinatorial Theory, Series (B), 28:208-236, 1980.
11. B. Servatius, O. Shai, and W. Whiteley. Assurance for assur graphs by rigidity circuits. Manuscript, 2006.
12. I. Streinu and L. Theran. Sparsity-certifying graph decompositions. Submitted to Graphs and Combinatorics, http://arxiv.org/abs/0704.0002, 2007.
13. W. Whiteley. The union of matroids and the rigidity of frameworks. SIAM Journal Discrete Mathematics, 1(2):237-255, May 1988.