Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Erik D. Demaine (Massachusetts Institute of Technology),Joseph O'Rourke (Olin Professor of Computer Science, Smith College, Massachusetts)

Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Format
Hardback
Publisher
Cambridge University Press
Country
United Kingdom
Published
16 July 2007
Pages
488
ISBN
9780521857574

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Erik D. Demaine (Massachusetts Institute of Technology),Joseph O'Rourke (Olin Professor of Computer Science, Smith College, Massachusetts)

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.

This item is not currently in-stock. It can be ordered online and is expected to ship in approx 2 weeks

Our stock data is updated periodically, and availability may change throughout the day for in-demand items. Please call the relevant shop for the most current stock information. Prices are subject to change without notice.

Sign in or become a Readings Member to add this title to a wishlist.