Peste 4 milioane de titluri în engleză și alte limbi! Descoperă-ți noua poveste astăzi!

Geometric Folding Algorithms

Name: Geometric Folding Algorithms
Brand: Cambridge University Press
SKU: 9780521857574
Price: 1145.59 RON
Availability: InStock

Autor: Erik D Demaine

Limbă:

Legare: Copertă tare

Editura: Cambridge University Press

Disponibilitate: În depozitul extern

Expediem în 9-15 zile

1 145.59 lei

Did you know that any straight-line drawing on paper can be folded so that the complete drawing can...

Informații despre carte

Autor

Erik D Demaine

Limbă

engleză

Legare

Carte - Copertă tare

Publicat

2007

Pagini

488

EAN

9780521857574

ISBN

0521857570

Enbook ID

04378975

Editura

Cambridge University Press

Greutate

1382

Dimensiuni

259 x 186 x 31

Descriere completă

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.