{"product_id":"geometric-folding-algorithms-linkages-origami-polyhedra-hardback-9780521857574","title":"Geometric Folding Algorithms; Linkages, Origami, Polyhedra (Hardback) 9780521857574","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eGeometric Folding Algorithms\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eLinkages, Origami, Polyhedra\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eLavishly illustrated and entertaining account of the surprising and useful results of the maths of folding and unfolding.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eErik D. Demaine (Author), Joseph O'Rourke (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521857574, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 16 July 2007\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e488 pages, 82 b\/w illus.  330 colour illus.  16 tables\u003cbr\u003e25.9 x 18.3 x 2.8 cm, 1.376 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'The authors explain step-by-step interesting solutions of some folding problems. This splendidly illustrated book can be interesting for advanced undergraduate students in mathematics and computer science as well as for geometers and computer specialists who can find many new ideas and impulses …' EMS Newsletter\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eDid 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eIntroduction\u003cbr\u003e Part I. Linkages: 1. Problem classification and examples\u003cbr\u003e 2. Upper and lower bounds\u003cbr\u003e 3. Planar linkage mechanisms\u003cbr\u003e 4. Rigid frameworks\u003cbr\u003e 5. Reconfiguration of chains\u003cbr\u003e 6. Locked chains\u003cbr\u003e 7. Interlocked chains\u003cbr\u003e 8. Joint-constrained motion\u003cbr\u003e 9. Protein folding\u003cbr\u003e Part II. Paper: 10. Introduction\u003cbr\u003e 11. Foundations\u003cbr\u003e 12. Simple crease patterns\u003cbr\u003e 13. General crease patterns\u003cbr\u003e 14. Map folding\u003cbr\u003e 15. Silhouettes and gift wrapping\u003cbr\u003e 16. The tree method\u003cbr\u003e 17. One complete straight cut\u003cbr\u003e 18. Flattening polyhedra\u003cbr\u003e 19. Geometric constructibility\u003cbr\u003e 20. Rigid origami and curved creases\u003cbr\u003e Part III. Polyhedra: 21. Introduction and overview\u003cbr\u003e 22. Edge unfolding of polyhedra\u003cbr\u003e 23. Reconstruction of polyhedra\u003cbr\u003e 24. Shortest paths and geodesics\u003cbr\u003e 25. Folding polygons to polyhedra\u003cbr\u003e 26. Higher dimensions.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Algorithms \u0026amp; data structures [\u003ca title=\"See our other books on Algorithms \u0026amp; data structures\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Algorithms%20\u0026amp;%20data%20structures%20%5BUMB%5D%22\"\u003eUMB\u003c\/a\u003e], Geometry [\u003ca title=\"See our other books on Geometry\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Geometry%20%5BPBM%5D%22\"\u003ePBM\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46004779450648,"sku":"9780521857574","price":148.25,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521857574i_5d348ea7-e1bb-4f30-9eea-b8e287d68824.jpg?v=1691358408","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/geometric-folding-algorithms-linkages-origami-polyhedra-hardback-9780521857574","provider":"Freshly Printed Books","version":"1.0","type":"link"}