Slider-Pinning Rigidity: a Maxwell–Laman-Type Theorem

@article{Streinu2010SliderPinningRA,
  title={Slider-Pinning Rigidity: a Maxwell–Laman-Type Theorem},
  author={I. Streinu and Louis Theran},
  journal={Discrete & Computational Geometry},
  year={2010},
  volume={44},
  pages={812-837}
}
  • I. Streinu, Louis Theran
  • Published 2010
  • Mathematics, Computer Science
  • Discrete & Computational Geometry
    • We define and study slider-pinning rigidity, giving a complete combinatorial characterization. This is done via direction-slider networks, which are a generalization of Whiteley’s direction networks. 
    View on Springer
    link.springer.com
    23 Citations
    Highly Influencial Citations
    3
    Background Citations
    15
    Methods Citations
    6
    Results Citations
    1

    Figures and Topics from this paper

    Figures

    Explore Further: Topics Discussed in This Paper

    23 Citations
    Citation Type

    Citation Type

    Generic combinatorial rigidity of periodic frameworks
    • 51
    • PDF
    Generic rigidity of reflection frameworks
    • 8
    • PDF
    Generic Rigidity with Forced Symmetry and Sparse Colored Graphs
    • 17
    • PDF
    Frameworks with Forced Symmetry I: Reflections and Rotations
    • 18
    • PDF
    Frameworks with coordinated edge motions
    • PDF
    Frameworks with forced symmetry II: orientation-preserving crystallographic groups
    • 7
    • PDF
    Generic rigidity of frameworks with orientation-preserving crystallographic symmetry
    • 15
    • PDF
    On rigidity, orientability, and cores of random graphs with sliders
    • 2
    • Highly Influenced
    • PDF
    Generic rigidity of frameworks with crystallographic symmetry
    • 2
    M G ] 7 J un 2 01 9 Frameworks with coordinated edge motions

    References

    SHOWING 1-10 OF 36 REFERENCES
    The Slider-Pinning Problem
    • 10
    • PDF
    On graphs and rigidity of plane skeletal structures
    • 950
    • PDF
    A new proof of laman’s theorem
    • T. Tay
    • Mathematics, Computer Science
    • Graphs Comb.
    • 1993
    • 32
    • Highly Influential
    Finding and Maintaining Rigid Components
    • 38
    • PDF
    Source location with rigidity and tree packing requirements
    • Z. Fekete
    • Mathematics, Computer Science
    • Oper. Res. Lett.
    • 2006
    • 22
    • Highly Influential
    • PDF
    A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection
    • A. Recski
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 1984
    • 20
    Constructive characterizations for packing and covering with trees
    • 43
    • PDF
    A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae
    • A. Recski
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 1984
    • 41
    An Algorithm for Two-Dimensional Rigidity Percolation
    • 290
    On Generic Rigidity in the Plane
    • 261