Geometric Folding Algorithms : Linkages, Origami, Polyhedra

作者：ErikDDemaine

出版社：CambridgeUniversityPress

副标题：Linkages,Origami,Polyhedra

出版年：2008-8-21

页数：488

定价：GBP35.99

装帧：Paperback

ISBN：9780521715225

内容简介
······

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.

评论 ······

做作手册备查吧，Miur-ori origami 扫过吧
ch4

打击数学工作者的从来不是那些听都听不懂的超难猜想，而是一个简单的问题却无法用数学求解。这种问题在数论与组合学中特别多，而这本书在前言的开头就扔出了五个这样的问题！随手翻一下，全书说明性文字占主体，配了很多图但没有练习题，几乎没数学证明。可是读来却并不友好，没有具体的建模过程，没有一步一步的数学推导，对我来说读着很不习惯。

打击数学工作者的从来不是那些听都听不懂的超难猜想，而是一个简单的问题却无法用数学求解。这种问题在数论与组合学中特别多，而这本书在前言的开头就扔出了五个这样的问题！随手翻一下，全书说明性文字占主体，配了很多图但没有练习题，几乎没数学证明。可是读来却并不友好，没有具体的建模过程，没有一步一步的数学推导，对我来说读着很不习惯。

做作手册备查吧，Miur-ori origami 扫过吧
ch4

• 下载电子版：下载地址
• 购买纸质版：京东商城
• 购买纸质版：当当网