Geometric Folding Algorithms: Linkages, Origami, Polyhedra
The DOI matches its Crossref record.
Abstract
Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Still being checked.
Cited by
Mechanical metamaterials associated with stiffness, rigidity and compressibility: A brief review
Yu, X., Zhou, J., Liang, H., Jiang, Z., & Wu, L. (2018) · Progress in Materials Science · doi:10.1016/j.pmatsci.2017.12.003 · Cited by 1,140
Materials and Structures toward Soft Electronics
Wang, C., Wang, C., Huang, Z., & Xu, S. (2018) · Advanced Materials · doi:10.1002/adma.201801368 · Cited by 662
Programmable matter by folding
Hawkes, E., An, B., Benbernou, N. M., Tanaka, H., Kim, S., Demaine, E. D., Rus, D., & Wood, R. J. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0914069107 · Cited by 658
Self-citationElastomeric Origami: Programmable Paper‐Elastomer Composites as Pneumatic Actuators
Martinez, R. V., Fish, C. R., Chen, X., & Whitesides, G. M. (2012) · Advanced Functional Materials · doi:10.1002/adfm.201102978 · Cited by 651
Design, fabrication and control of origami robots
Rus, D., & Tolley, M. T. (2018) · Nature Reviews Materials · doi:10.1038/s41578-018-0009-8 · Cited by 641
Metadata
- Authors
- Demaine, E. D., & O'Rourke, J.
- Affiliations
- Massachusetts Institute of Technology (US)
- ORCID
- Demaine, Erik D.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2007-07-16
- OpenAlex
- W4238518651
- Semantic Scholar
- fef8f91bb7e20191a6e8cdf6452a7755b74c5ad2
- Cited by
- 433
- References
- 0
- Citations by year
- 2026: 29 · 2025: 32 · 2024: 30 · 2023: 18 · 2022: 31 · 2021: 33 · 2020: 40 · 2019: 24 · 2018: 38 · 2017: 28 · 2016: 22 · 2015: 21 · 2014: 14 · 2013: 22 · 2012: 15
- FWCI
- 12.90
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Cambridge University Press eBooks (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- computational origami, folding algorithm, planar mechanisms, origami, convex polyhedra, algebraic curves, open problems, protein folding, robotics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. https://app.cochat.ai/papers/10.1017/cbo9780511735172
- The paper
- Demaine, E. D., & O'Rourke, J. (2007). Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9780511735172
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.