SIGN IN
SIGN UP
Locked and unlocked chains of planar shapes
Full Text:
Pdf
Buy this Article
Authors:
Robert Connelly
Cornell University Ithaca, NY
Erik D. Demaine
MIT CSAIL, Cambridge, MA
Martin L. Demaine
MIT CSAIL, Cambridge, MA
Sándor P. Fekete
TU Braunschweig, Braunschweig, Germany
Stefan Langerman
Université Libre de Bruxelles, Belgium
Joseph S. B. Mitchell
Stony Brook University, Stony Brook, NY
Ares Ribó
Freie Universität Berlin, Berlin, Germany
Günter Rote
Freie Universität Berlin, Berlin, Germany
2006 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 17
· Downloads (cumulative): 153
· Citation Count: 3
Published in:
· Proceeding
SCG '06
Proceedings of the twenty-second annual symposium on Computational geometry
Pages 61 - 70
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-340-9
doi>
10.1145/1137856.1137868
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
folding
geometrical problems and computations
hinged dissections
linkages
locked chains
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder