On the infinitesimal rigidity of bar-and-slider frameworks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 524-533

  Katoh, Naoki ^a   Tanigawa, Shin Ichi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TWO DIMENSIONAL SPACES;

RIGIDITY;

COMPUTATION THEORY;

EID: 75649095270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_54     Document Type: Conference Paper

References (14)

1. Crapo, H.: On the generic rigidity of plane frameworks. Technical Report 1278, Institute de recherche d'informatique et d'automatique (1988)
2. Fekete, Z.: Source location with rigidity and tree packing requirements. Operations Research Letters 34(6), 607-612 (2006)
3. Fekete, Z., Jordán, T.: Uniquely localizable networks with few anchors. In: Niko-letseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol. 4240, pp. 176-183. Springer, Heidelberg (2006)
4. Laman, G.: On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics 4, 331-340 (1970)
5. Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. Discrete Mathematics 308(8), 1425-1437 (2008)
6. Lee, A., Streinu, I., Theran, L.: The slider-pinning problem. In: Proc. 19th Canadian Conference on Computational Geometry, CCCG 2007 (2007)
7. Lovász, L.: Matroid matching and some applications. J. Combinatorial Theory, Series (B) 28, 208-236 (1980)
8. Oxley, J.: Matroid Theory. Oxford University Press, Oxford (1992)
9. Pym, J.S., Perfect, H.: Submodular functions and independence structures. J. Math. Analysis Appl. 30, 1-31 (1970)
10. Servatius, B., Shai, O., Whiteley, W.: Combinatorial characterization of the assur graphs from engineering. arXiv:0801.252v1 (2008)
11. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
12. Streinu, I., Theran, L.: Combinatorial genericity and minimal rigidity. In: Proc. ACM Symposium on Computational Geometry (SoCG 2008), pp. 365-374 (2008)
13. Streinu, I., Theran, L.: Sparsity-certifying graph decompositions. Graphs and Combinatorics 25(2), 219-238 (2009)
14. Whiteley, W.: Matroids from discrete geometry. In: Bonin, J., Oxley, J., Servatius, B. (eds.) Matroid Theory. AMS Contemporary Mathematics, pp. 171-313 (1997)