Skip to main content
Journal ArticleOPEN ACCESS

Slider-pinning rigidity: A maxwell-laman-type theorem

Discrete and Computational Geometry (2010) 44(4) 812-837
DOI: 10.1007/s00454-010-9283-y
24Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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. © 2010 Springer Science+Business Media, LLC.

Author supplied keywords

References Powered by Scopus

On graphs and rigidity of plane skeletal structures

Journal of Engineering Mathematics
779Citations
118Readers
Get full text

Pebble game algorithms and sparse graphs

Discrete Mathematics
160Citations
44Readers

This article is free to access.

Matroid matching and some applications

Journal of Combinatorial Theory, Series B
133Citations
22Readers
View more at Scopus

Cited by Powered by Scopus

Get full text

Point-hyperplane frameworks, slider joints, and rigidity preserving transformations

Journal of Combinatorial Theory. Series B
14Citations
2Readers
View more at Scopus

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Streinu, I., & Theran, L. (2010). Slider-pinning rigidity: A maxwell-laman-type theorem. Discrete and Computational Geometry, 44(4), 812–837. https://doi.org/10.1007/s00454-010-9283-y

Readers over time

‘16‘18‘19‘2000.511.52

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 2

67%

Professor / Associate Prof. 1

33%

Readers' Discipline

Tooltip

Computer Science 2

67%

Engineering 1

33%

Save time finding and organizing research with Mendeley

Sign up for free
0