Több mint 4 millió cím angol és más nyelveken! Fedezd fel új történetedet még ma!

Geometric Folding Algorithms

Name: Geometric Folding Algorithms
Brand: Cambridge University Press
SKU: 9780521857574
Price: 79685 HUF
Availability: InStock

Szerző: Erik D Demaine

Nyelv:

Kötés: Kemény kötésű

Kiadó: Cambridge University Press

Elérhetőség: Beszállítói készleten

Küldés 9-15 napon belül

79 685 Ft

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

Információk a könyvről

Szerző

Erik D Demaine

Nyelv

Angol

Kötés

Könyv - Kemény kötésű

Kiadva

2007

oldal

488

EAN

9780521857574

ISBN

0521857570

Enbook ID

04378975

Kiadó

Cambridge University Press

Súly

1382

Méretek

259 x 186 x 31

Teljes leírás

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.