Sign In | Not yet a member? | Submit your article
 
Home   Technical   Study   Novel   Nonfiction   Health   Tutorial   Entertainment   Business   Magazine   Arts & Design   Audiobooks & Video Training   Cultures & Languages   Family & Home   Law & Politics   Lyrics & Music   Software Related   eBook Torrents   Uncategorized  
Letters: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Geometric Folding Algorithms: Linkages, Origami, Polyhedra
Date: 24 April 2011, 01:42

Free Download Now     Free register and download UseNet downloader, then you can FREE Download from UseNet.

    Download without Limit " Geometric Folding Algorithms: Linkages, Origami, Polyhedra " from UseNet for FREE!
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.

DISCLAIMER:

This site does not store Geometric Folding Algorithms: Linkages, Origami, Polyhedra on its server. We only index and link to Geometric Folding Algorithms: Linkages, Origami, Polyhedra provided by other sites. Please contact the content providers to delete Geometric Folding Algorithms: Linkages, Origami, Polyhedra if any and email us, we'll remove relevant links or contents immediately.



Comments

Comments (0) All

Verify: Verify

    Sign In   Not yet a member?


Popular searches