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
প্রকাশক:
Cambridge University Press
ভাষা:
english
পৃষ্ঠা:
486
ISBN 10:
0521857570
ISBN 13:
9780521857574
ফাইল:
PDF, 10.86 MB
IPFS:
,
english, 2007
Amazon 
Barnes & Noble 
Bookshop.org
বুক স্টোর যোগ করতে চান? support@z-lib.do এ আমাদের সাথে যোগাযোগ করুন
File converter
অনুসন্ধানের আরো ফলাফল
More benefits 
