- Main
- Mathematics - Geometry and Topology
- Geometric Folding Algorithms: Linkages,...
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Erik D. Demaine, Joseph O'Rourke你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?
How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results in this comprehensive look at the mathematics of folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.
年:
2007
出版:
1
出版社:
Cambridge University Press
语言:
english
页:
486
ISBN 10:
0521857570
ISBN 13:
9780521857574
文件:
PDF, 10.75 MB
您的标签:
IPFS:
CID , CID Blake2b
english, 2007
在1-5分钟内,文件将被发送到您的电子邮件。
该文件将通过电报信使发送给您。 您最多可能需要 1-5 分钟才能收到它。
注意:确保您已将您的帐户链接到 Z-Library Telegram 机器人。
该文件将发送到您的 Kindle 帐户。 您最多可能需要 1-5 分钟才能收到它。
请注意:您需要验证要发送到Kindle的每本书。检查您的邮箱中是否有来自亚马逊Kindle的验证电子邮件。
正在转换
转换为 失败