-
Erik D. Demaine
Click on cover to enlarge.
Buy This Book
From Amazon.
11 - 13Hours to read
دانلود کتاب Geometric Folding Algorithms: Linkages, Origami, Polyhedra
by Erik D. Demaine|
|
عنوان فارسی: هندسی الگوریتم تاشو: ارتباط ، اریگامی، polyhedra به |
دانلود کتاب
جزییات کتاب
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.
کتاب های مرتبط
این کتاب رو مطالعه کردید؟ نظر شما چیست؟
برای ارسال نظر، لطفا وارد شوید.
نظر دهید
نظرات (0)
هنوز نظری داده نشده است. شما اولین باشید!
