
Download App
>> | LShop | >> | Book | >> | Computing & Informat... | >> | Computer Programming... | >> | Geometric Folding Al... |
ISBN
:
9780521857574
Publisher
:
Cambridge University Press
Subject
:
Computer Programming / Software Development, Mathematics
Binding
:
HARDCOVER
Pages
:
496
Year
:
2007
₹
11516.0
₹
8752.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View Details(Imported Edition) Estimated Shipping Time : 15-18 Business Days
View DetailsDescription
How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein 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.
Related Items
-
of
Designing Concurrent, Distributed, and Real-Time Applications with UML
Hassan Gomaa
Starts At
6079.0
7999.0
24% OFF
Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (Foundations of Computing)
Carl A. Gunter
Starts At
12973.0
15085.0
14% OFF
Artificial Life VII: Proceedings of the Seventh International Conference on Artificial Life (Complex Adaptive Systems)
Mark Bedau
Starts At
6602.0
7677.0
14% OFF