Geometric Folding Algorithmstxt,chm,pdf,epub,mobi下载 作者:Erik D. Demaine/Joseph O'Rourke 出版社: Cambridge University Press 副标题: Linkages, Origami, Polyhedra 出版年: 2008 页数: 496 定价: 475.00元 装帧: 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 o...
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.
|
值得一看
回转曲折,坎坷不平
没想到刚开始就牢牢抓住了我的眼球。
翻译得也很棒