Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-2lccl Total loading time: 0 Render date: 2024-04-25T15:42:51.643Z Has data issue: false hasContentIssue false

6 - Locked Chains

Published online by Cambridge University Press:  07 September 2010

Erik D. Demaine
Affiliation:
Massachusetts Institute of Technology
Joseph O'Rourke
Affiliation:
Smith College, Massachusetts
Get access

Summary

INTRODUCTION

We know from Section 2.2.2 that configuration spaces of general linkages that are permitted to self-intersect, even in ℝ2, can have exponentially many connected components. On the other hand, we know from Section 5.1.1.1 (p. 59) and Section 5.1.2 (p. 66) that configuration spaces of open and closed 3D chains that are permitted to self-intersect have just one connected component. We also know from Section 5.3 (p. 70) that configuration spaces of planar chains have just one connected component when permitted to move into ℝ3 but forbidden to self-cross. We have until now avoided the most natural questions, which concern chains embedded in ℝd, with motion confined to the same space ℝd, without self-crossings. These questions avoid the generality of linkages on the one hand, and the special assumptions of planar embeddings or projections on the other hand.

The main question addressed in this context is which types of linkages always have connected configuration spaces. A linkage with a connected configuration space is unlocked: no two configurations are prevented from reaching each other. If a linkage in 3D or higher dimensions has a disconnected configuration space, it is locked. But for connectivity of the configuration space to be possible in 2D, we need to place an additional constraint, because planar closed chains cannot be turned “inside-out” as they could in Section 5.1.2 when we permitted the chain to self-intersect.

Type
Chapter
Information
Geometric Folding Algorithms
Linkages, Origami, Polyhedra
, pp. 86 - 122
Publisher: Cambridge University Press
Print publication year: 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Locked Chains
  • Erik D. Demaine, Massachusetts Institute of Technology, Joseph O'Rourke, Smith College, Massachusetts
  • Book: Geometric Folding Algorithms
  • Online publication: 07 September 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511735172.008
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Locked Chains
  • Erik D. Demaine, Massachusetts Institute of Technology, Joseph O'Rourke, Smith College, Massachusetts
  • Book: Geometric Folding Algorithms
  • Online publication: 07 September 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511735172.008
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Locked Chains
  • Erik D. Demaine, Massachusetts Institute of Technology, Joseph O'Rourke, Smith College, Massachusetts
  • Book: Geometric Folding Algorithms
  • Online publication: 07 September 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511735172.008
Available formats
×