Origami Book Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Kim Phụng

Active Member
Contributor
Reputation: 100%
7/4/15
768
12,267
26
25
Thumbnail
Resources
Amazon.com
Author
Erik D. Demaine
Printed File Format
PDF
Geometric Folding Algorithms: Linkages, Origami, Polyhedra

ISBN/ASIN: 0521715229
ISBN-10: 0521857570
ISBN-13: 978-0521857574

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.

 
Sponsored: Google Advertising

Attachments

  • Geometric Folding Algorithms- Linkages, Origami, Polyhedra.pdf
    4.3 MB · Views: 228
Sponsored: Google Advertising