Document Type

Article

Publication Date

12-2010

Publication Title

Discrete & Computational Geometry

Abstract

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.

Keywords

Rigidity theory, Matroids, Sparse graphs

Volume

44

Issue

4

First Page

812

Last Page

837

DOI

dx.doi.org/10.1007/s00454-010-9283-y

ISSN

1432-0444

Comments

Peer reviewed accepted manuscript.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 24
  • Usage
    • Downloads: 154
    • Abstract Views: 5
  • Captures
    • Readers: 5
see details

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.