Geometric Folding Algorithms: Linkages, Origami, Polyhedra

by Erik D. Demaine and Joseph O'Rourke

0 ratings • 0 reviews • 0 shelved
Book cover for Geometric Folding Algorithms

Bookhype may earn a small commission from qualifying purchases. Full disclosure.

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.
  • ISBN13 9780521715225
  • Publish Date 21 August 2008 (first published 16 July 2007)
  • Publish Status Active
  • Out of Print 24 May 2021
  • Publish Country GB
  • Imprint Cambridge University Press
  • Format Paperback (US Trade)
  • Pages 496
  • Language English