Get Free Shipping on orders over $79
Geometric Folding Algorithms : Linkages, Origami, Polyhedra - Erik D. Demaine

Geometric Folding Algorithms

Linkages, Origami, Polyhedra

By: Erik D. Demaine, Joseph O'Rourke

eBook | 10 November 2015

At a Glance

eBook


RRP $113.95

$96.90

15%OFF

or 4 interest-free payments of $24.23 with

 or 

Instant Digital Delivery to your Kobo Reader App

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.

on

More in Computer Science

Amazon.com : Get Big Fast - Robert Spector

eBOOK

Writing Game Histories : Writing History - Esther Wright

eBOOK

RRP $45.00

$40.58

10%
OFF