株式会社極東書店トップ ＞ 商品一覧 ＞ Geometric Folding Algorithms : Linkages, Origami, Polyhedra.
商品詳細
Geometric Folding Algorithms : Linkages, Origami, Polyhedra.
・ISBN 978-0-521-85757-4 hard GB£ 167.00
￥52,905.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-0-511-73517-2
| 著者・編者 | Demaine, Erik D. / O'Rourke, Joseph, |
|---|---|
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 2007 |
| ページ数 | 488 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-10261＞ |
解説
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.