Research Catalog

Title

Geometric folding algorithms : linkages, origami, polyhedra / Erik D. Demaine, Joseph O'Rourke.

Author

Demaine, Erik D., 1981-

Publication

Cambridge ; New York : Cambridge University Press, 2007.

Supplementary Content

• Contributor biographical information
• Publisher description

Items in the Library & Off-site

Details

Additional Authors

O'Rourke, Joseph

Description

xiii, 472 p. : ill. (some col.); 26 cm.

Summary

Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research.

Subjects

• Polyèdres > Informatique
• Algorithmische Geometrie
• Polyèdres > Modèles
• Polyeder
• Polyhedra > Data processing
• Polyhedra > Models

Bibliography (note)

• Includes bibliographical references (p. 443-461) and index.

Contents

Introduction -- pt. 1. Linkages. Problem classification and examples -- Upper and lower bounds -- Planar linkage mechanisms -- Rigid frameworks -- Reconfiguration of chains -- Locked chains -- Interlocked chains -- Joint-constrained motion -- Protein folding -- pt. 2. Paper. Introduction -- Foundations -- Simple crease patterns -- General crease patterns -- Map folding -- Silhouettes and gift wrapping -- The tree method -- One complete straight cut -- Flattening polyhedra -- Geometric constructibility -- Rigid origami and curved creases -- pt. 3. Polyhedra. Introduction and overview -- Edge unfolding of polyhedra -- Reconstruction of polyhedra -- Shortest paths and geodesics -- Folding polygons to polyhedra -- Higher dimensions.

ISBN

• 9780521857574
• 0521857570
• 9780521715225
• 0521715229

LCCN

2006038156

OCLC

• ocm76416607
• 76416607
• SCSB-5598659

Owning Institutions

Columbia University Libraries