Geometric Folding Algorithms

Geometric Folding Algorithms

Pris
1 229,-
E-Bok
E-bøkene legges i din ARK-leseapp. Bøkene kan også lastes ned fra Din side.
×
Logg deg inn for å gjennomføre dette kjøpet med ett klikk!

Etter at kjøpet er gjennomført vil boken være tilgjengelig på «din side» og i ARK-appen
Skriv anmeldelse
Format E-Bok
Filformat PDF
Utgivelsesår 2007
Forlag Cambridge University Press
Språk Engelsk
ISBN 9781139883283
Emne Geometry

Om Geometric Folding Algorithms

Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.


Kundevurderinger

ARKs anbefalinger

Det finnes ingen vurderinger av dette produktet. Skriv anmeldelse

Mer fra Erik D. Demaine; Joseph O'Rourke (Olin Professor of Computer Science, Smith College, Massachusetts)

Anbefalt


Tips en venn