Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Geometric Folding Algorithms : Linkages, Origami, Polyhedra, EPUB eBook

Geometric Folding Algorithms : Linkages, Origami, Polyhedra EPUB

EPUB

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Information