Geometric folding algorithms: linkages, origami, polyhedra
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. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'ope...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2007
|
| Ausgabe: | 1. publ. |
| Schlagworte: | |
| Online-Zugang: | Publisher description Table of contents only Inhaltsverzeichnis |
| Zusammenfassung: | 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. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research. |
| Beschreibung: | Includes index. |
| Beschreibung: | XIII, 472 S. zahlr. graph. Darst. |
| ISBN: | 9780521857574 0521857570 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV022620226 | ||
| 003 | DE-604 | ||
| 005 | 20090429 | ||
| 007 | t | ||
| 008 | 070823s2007 xxud||| |||| 00||| eng d | ||
| 010 | |a 2006038156 | ||
| 020 | |a 9780521857574 |c hardback |9 978-0-521-85757-4 | ||
| 020 | |a 0521857570 |9 0-521-85757-0 | ||
| 035 | |a (OCoLC)76416607 | ||
| 035 | |a (DE-599)BVBBV022620226 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c US | ||
| 049 | |a DE-12 |a DE-703 |a DE-83 |a DE-11 |a DE-188 |a DE-29T | ||
| 050 | 0 | |a QA491 | |
| 082 | 0 | |a 516/.156 | |
| 084 | |a SK 380 |0 (DE-625)143235: |2 rvk | ||
| 084 | |a ST 320 |0 (DE-625)143657: |2 rvk | ||
| 084 | |a 52Bxx |2 msc | ||
| 100 | 1 | |a Demaine, Erik D. |d 1981- |e Verfasser |0 (DE-588)123829704 |4 aut | |
| 245 | 1 | 0 | |a Geometric folding algorithms |b linkages, origami, polyhedra |c Erik D. Demaine, Joseph O'Rourke |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2007 | |
| 300 | |a XIII, 472 S. |b zahlr. graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Includes index. | ||
| 520 | 3 | |a 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. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research. | |
| 650 | 4 | |a Polyèdres - Informatique | |
| 650 | 4 | |a Polyèdres - Modèles | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Polyhedra |x Models | |
| 650 | 4 | |a Polyhedra |x Data processing | |
| 650 | 0 | 7 | |a Polyeder |0 (DE-588)4132101-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Falten |0 (DE-588)4153638-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Geometrie |0 (DE-588)4020236-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Polyeder |0 (DE-588)4132101-7 |D s |
| 689 | 0 | 1 | |a Falten |0 (DE-588)4153638-1 |D s |
| 689 | 0 | 2 | |a Geometrie |0 (DE-588)4020236-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a O'Rourke, Joseph |d 1951- |e Verfasser |0 (DE-588)114449708 |4 aut | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0703/2006038156-d.html |3 Publisher description | |
| 856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0703/2006038156-t.html |3 Table of contents only | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015826302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015826302 | ||
Datensatz im Suchindex
| _version_ | 1804136779855429632 |
|---|---|
| adam_text | Titel: Geometric folding algorithms
Autor: Demaine, Erik D.
Jahr: 2007
Contents
Preface page xi
0 Introduction 1
0.1 Design Problems 1
0.2 Foldability Questions 3
Part I. Linkages
1 Problem Classification and Examples 9
1.1 Classification 10
1.2 Applications 11
2 Upper and Lower Bounds 17
2.1 General Algorithms and Upper Bounds 17
2.2 Lower Bounds 22
3 Planar Linkage Mechanisms 29
3.1 Straight-Line Linkages 29
3.2 Kempe s Universality Theorem 31
3.3 Hart s Inversor 40
4 Rigid Frameworks 43
4.1 Brief History 43
4.2 Rigidity 43
4.3 Generic Rigidity 44
4.4 Infinitesimal Rigidity 49
4.5 Tensegrities 53
4.6 Polyhedral Liftings 57
5 Reconfiguration of Chains 59
5.1 Reconfiguration Permitting Intersection 59
5.2 Reconfiguration in Confined Regions 67
5.3 Reconfiguration Without Self-Crossing 70
6 Locked Chains 86
6.1 Introduction 86
6.2 History 87
vii
^VHraH I Contents !
6.3 Locked Chains in 3D 88
6.4 No Locked Chains in 4D 92
6.5 Locked Trees in 2D 94
6.6 No Locked Chains in 2D 96
6.7 Algorithms for Unlocking 2D Chains 105
6.8 Infinitesimally Locked Linkages in 2D 113
6.9 3D Polygons with a Simple Projection 119
7 Interlocked Chains 123
7.1 2-Chains 125
7.2 3-Chains 126
7.3 4-Chains 127
8 Joint-Constrained Motion 131
8.1 Fixed-Angle Linkages 131
8.2 Convex Chains 143
9 Protein Folding 148
9.1 Producible Polygonal Protein Chains 148
9.2 Probabilistic Roadmaps 154
9.3 HP Model 158
Part II. Paper
10 Introduction 167
10.1 History of Origami 167
10.2 History of Origami Mathematics 168
10.3 Terminology 169
10.4 Overview 170
11 Foundations 172
11.1 Definitions: Getting Started 172
11.2 Definitions: Folded States of ID Paper 175
11.3 Definitions: Folding Motions of ID Paper 182
11.4 Definitions: Folded States of 2D Paper 183
11.5 Definitions: Folding Motions of 2D Paper 187
11.6 Folding Motions Exist 189
12 Simple Crease Patterns 193
12.1 One-Dimensional Flat Foldings 193
12.2 Single-Vertex Crease Patterns 198
12.3 Continuous Single-Vertex Foldability 212
13 General Crease Patterns 214
13.1 Local Flat Foldability is Easy 214
13.2 Global Flat Foldability is Hard 217
14 MapFoldlng 224
14.1 Simple Folds 225
14.2 Rectangular Maps: Reduction to ID 227
14.3 Hardness of Folding Orthogonal Polygons 228
14.4 Open Problems 230
I
Contents I HVEHJ
15 Silhouettes and Gift Wrapping 232
15.1 Strip Folding 233
15.2 Hamiltonian Triangulation 233
15.3 Seam Placement 236
15.4 Efficient Foldings 237
16 The Tree Method 240
16.1 Origami Bases 240
16.2 Uniaxial Bases 242
16.3 Everything is Possible 243
16.4 Active Paths 244
16.5 Scale Optimization 246
16.6 Convex Decomposition 247
16.7 Overview of Folding 249
16.8 Universal Molecule 250
17 One Complete Straight Cut 254
17.1 Straight-Skeleton Method 256
17.2 Disk-Packing Method 263
18 Flattening Polyhedra 279
18.1 Connection to Part III: Models of Folding 279
18.2 Connection to Fold-and-Cut Problem 280
18.3 Solution via Disk Packing 281
18.4 Partial Solution via Straight Skeleton 281
19 Geometric Constructibility 285
19.1 Trisection 285
19.2 Huzita s Axioms and Hatori s Addition 285
19.3 Constructible Numbers 288
19.4 Folding Regular Polygons 289
19.5 Generalizing the Axioms to Solve All Polynomials? 290
20 Rigid Origami and Curved Creases 292
20.1 Folding Paper Bags 292
20.2 Curved Surface Approximation 293
20.3 David Huffman s Curved-Folds Origami 296
Part III. Polyhedra
21 Introduction and Overview . , 299
21.1 Overview 299
21.2 Curvature 301
21.3 Gauss-Bonnet Theorem 304
22 Edge Unfolding of Polyhedra 306
22.1 Introduction 306
; 22.2 Evidence for Edge Unfoldings 312
22.3 Evidence against Edge Unfoldings 313
22.4 Unfoldable Polyhedra 318
22.5 Special Classes of Edge-Unfoldable Polyhedra 321
22.6 Vertex Unfoldings 333
^IQJH Contents
23 Reconstruction of Polyhedra 339
23.1 Cauchy s Rigidity Theorem 341
23.2 Flexible Polyhedra 345
23.3 Alexandrov s Theorem 348
23.4 Sabitov s Algorithm 354
24 Shortest Paths and Geodesies 358
24.1 Introduction 358
24.2 Shortest Paths Algorithms 362
24.3 Star Unfolding 366
24.4 Geodesies: Lyustermk-Schnirelmann 372
24.5 Curve Development 375
25 Folding Polygons to Polyhedra 381
25.1 Folding Polygons: Preliminaries 381
25.2 Edge-to-Edge Gluings 386
25.3 Gluing Trees 392
- 25.4 Exponential Number of Gluing Trees 396
25.5 General Gluing Algorithm 399
25.6 The Foldings of the Latin Cross 402
25.7 The Foldings of a Square to Convex Polyhedra 411
25.8 Consequences and Conjectures 418
25.9 Enumerations of Foldings 426
25.10 Enumerations of Cuttings 429
25.11 Orthogonal Polyhedra 431
26 Higher Dimensions 437
26.1 Parti 437
26.2 Part II 437
26.3 Part III 438
Bibliography 443
Index 461
|
| adam_txt |
Titel: Geometric folding algorithms
Autor: Demaine, Erik D.
Jahr: 2007
Contents
Preface page xi
0 Introduction 1
0.1 Design Problems 1
0.2 Foldability Questions 3
Part I. Linkages
1 Problem Classification and Examples 9
1.1 Classification 10
1.2 Applications 11
2 Upper and Lower Bounds 17
2.1 General Algorithms and Upper Bounds 17
2.2 Lower Bounds 22
3 Planar Linkage Mechanisms 29
3.1 Straight-Line Linkages 29
3.2 Kempe's Universality Theorem 31
3.3 Hart's Inversor 40
4 Rigid Frameworks 43
4.1 Brief History 43
4.2 Rigidity 43
4.3 Generic Rigidity 44
4.4 Infinitesimal Rigidity 49
4.5 Tensegrities 53
4.6 Polyhedral Liftings 57
5 Reconfiguration of Chains 59
5.1 Reconfiguration Permitting Intersection 59
5.2 Reconfiguration in Confined Regions 67
5.3 Reconfiguration Without Self-Crossing 70
6 Locked Chains 86
6.1 Introduction 86
6.2 History 87
vii
^VHraH I Contents !
6.3 Locked Chains in 3D 88
6.4 No Locked Chains in 4D 92
6.5 Locked Trees in 2D 94
6.6 No Locked Chains in 2D 96
6.7 Algorithms for Unlocking 2D Chains 105
6.8 Infinitesimally Locked Linkages in 2D 113
6.9 3D Polygons with a Simple Projection 119
7 Interlocked Chains 123
7.1 2-Chains 125
7.2 3-Chains 126
7.3 4-Chains 127
8 Joint-Constrained Motion 131
8.1 Fixed-Angle Linkages 131
8.2 Convex Chains 143
9 Protein Folding 148
9.1 Producible Polygonal Protein Chains 148
9.2 Probabilistic Roadmaps 154
9.3 HP Model 158
Part II. Paper
10 Introduction 167
10.1 History of Origami 167
10.2 History of Origami Mathematics 168
10.3 Terminology 169
10.4 Overview 170
11 Foundations 172
11.1 Definitions: Getting Started 172
11.2 Definitions: Folded States of ID Paper 175
11.3 Definitions: Folding Motions of ID Paper 182
11.4 Definitions: Folded States of 2D Paper 183
11.5 Definitions: Folding Motions of 2D Paper 187
11.6 Folding Motions Exist 189
12 Simple Crease Patterns 193
12.1 One-Dimensional Flat Foldings 193
12.2 Single-Vertex Crease Patterns 198
12.3 Continuous Single-Vertex Foldability 212
13 General Crease Patterns 214
13.1 Local Flat Foldability is Easy 214
13.2 Global Flat Foldability is Hard 217
14 MapFoldlng 224
14.1 Simple Folds 225
14.2 Rectangular Maps: Reduction to ID 227
14.3 Hardness of Folding Orthogonal Polygons 228
14.4 Open Problems 230
I
Contents I HVEHJ
15 Silhouettes and Gift Wrapping 232
15.1 Strip Folding 233
15.2 Hamiltonian Triangulation 233
15.3 Seam Placement 236
15.4 Efficient Foldings 237
16 The Tree Method 240
16.1 Origami Bases 240
16.2 Uniaxial Bases 242
16.3 Everything is Possible 243
16.4 Active Paths 244
16.5 Scale Optimization 246
16.6 Convex Decomposition 247
16.7 Overview of Folding 249
16.8 Universal Molecule 250
17 One Complete Straight Cut 254
17.1 Straight-Skeleton Method 256
17.2 Disk-Packing Method 263
18 Flattening Polyhedra 279
18.1 Connection to Part III: Models of Folding 279
18.2 Connection to Fold-and-Cut Problem 280
18.3 Solution via Disk Packing 281
18.4 Partial Solution via Straight Skeleton 281
19 Geometric Constructibility 285
19.1 Trisection 285
19.2 Huzita's Axioms and Hatori's Addition 285
19.3 Constructible Numbers 288
19.4 Folding Regular Polygons 289
19.5 Generalizing the Axioms to Solve All Polynomials? 290
20 Rigid Origami and Curved Creases 292
20.1 Folding Paper Bags 292
20.2 Curved Surface Approximation 293
20.3 David Huffman's Curved-Folds Origami 296
Part III. Polyhedra
21 Introduction and Overview . , 299
21.1 Overview 299
21.2 Curvature 301
21.3 Gauss-Bonnet Theorem 304
22 Edge Unfolding of Polyhedra 306
22.1 Introduction 306
; 22.2 Evidence for Edge Unfoldings 312
22.3 Evidence against Edge Unfoldings 313
22.4 Unfoldable Polyhedra 318
22.5 Special Classes of Edge-Unfoldable Polyhedra 321
22.6 Vertex Unfoldings 333
^IQJH Contents
23 Reconstruction of Polyhedra 339
23.1 Cauchy's Rigidity Theorem 341
23.2 Flexible Polyhedra 345
23.3 Alexandrov's Theorem 348
23.4 Sabitov's Algorithm 354
24 Shortest Paths and Geodesies 358
24.1 Introduction 358
24.2 Shortest Paths Algorithms 362
24.3 Star Unfolding 366
24.4 Geodesies: Lyustermk-Schnirelmann 372
24.5 Curve Development 375
25 Folding Polygons to Polyhedra 381
25.1 Folding Polygons: Preliminaries 381
25.2 Edge-to-Edge Gluings 386
25.3 Gluing Trees 392
- 25.4 Exponential Number of Gluing Trees 396
25.5 General Gluing Algorithm 399
25.6 The Foldings of the Latin Cross 402
25.7 The Foldings of a Square to Convex Polyhedra 411
25.8 Consequences and Conjectures 418
25.9 Enumerations of Foldings 426
25.10 Enumerations of Cuttings 429
25.11 Orthogonal Polyhedra 431
26 Higher Dimensions 437
26.1 Parti 437
26.2 Part II 437
26.3 Part III 438
Bibliography 443
Index 461 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Demaine, Erik D. 1981- O'Rourke, Joseph 1951- |
| author_GND | (DE-588)123829704 (DE-588)114449708 |
| author_facet | Demaine, Erik D. 1981- O'Rourke, Joseph 1951- |
| author_role | aut aut |
| author_sort | Demaine, Erik D. 1981- |
| author_variant | e d d ed edd j o jo |
| building | Verbundindex |
| bvnumber | BV022620226 |
| callnumber-first | Q - Science |
| callnumber-label | QA491 |
| callnumber-raw | QA491 |
| callnumber-search | QA491 |
| callnumber-sort | QA 3491 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 380 ST 320 |
| ctrlnum | (OCoLC)76416607 (DE-599)BVBBV022620226 |
| dewey-full | 516/.156 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 516 - Geometry |
| dewey-raw | 516/.156 |
| dewey-search | 516/.156 |
| dewey-sort | 3516 3156 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02571nam a2200577zc 4500</leader><controlfield tag="001">BV022620226</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090429 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">070823s2007 xxud||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2006038156</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521857574</subfield><subfield code="c">hardback</subfield><subfield code="9">978-0-521-85757-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521857570</subfield><subfield code="9">0-521-85757-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)76416607</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022620226</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA491</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">516/.156</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 380</subfield><subfield code="0">(DE-625)143235:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 320</subfield><subfield code="0">(DE-625)143657:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">52Bxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Demaine, Erik D.</subfield><subfield code="d">1981-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123829704</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Geometric folding algorithms</subfield><subfield code="b">linkages, origami, polyhedra</subfield><subfield code="c">Erik D. Demaine, Joseph O'Rourke</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2007</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 472 S.</subfield><subfield code="b">zahlr. graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes index.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polyèdres - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polyèdres - Modèles</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polyhedra</subfield><subfield code="x">Models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Polyhedra</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Falten</subfield><subfield code="0">(DE-588)4153638-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Geometrie</subfield><subfield code="0">(DE-588)4020236-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Falten</subfield><subfield code="0">(DE-588)4153638-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Geometrie</subfield><subfield code="0">(DE-588)4020236-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">O'Rourke, Joseph</subfield><subfield code="d">1951-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)114449708</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0703/2006038156-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0703/2006038156-t.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015826302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015826302</subfield></datafield></record></collection> |
| id | DE-604.BV022620226 |
| illustrated | Illustrated |
| index_date | 2024-07-02T18:19:49Z |
| indexdate | 2024-07-09T21:01:50Z |
| institution | BVB |
| isbn | 9780521857574 0521857570 |
| language | English |
| lccn | 2006038156 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015826302 |
| oclc_num | 76416607 |
| open_access_boolean | |
| owner | DE-12 DE-703 DE-83 DE-11 DE-188 DE-29T |
| owner_facet | DE-12 DE-703 DE-83 DE-11 DE-188 DE-29T |
| physical | XIII, 472 S. zahlr. graph. Darst. |
| publishDate | 2007 |
| publishDateSearch | 2007 |
| publishDateSort | 2007 |
| publisher | Cambridge Univ. Press |
| record_format | marc |
| spelling | Demaine, Erik D. 1981- Verfasser (DE-588)123829704 aut Geometric folding algorithms linkages, origami, polyhedra Erik D. Demaine, Joseph O'Rourke 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2007 XIII, 472 S. zahlr. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Includes index. 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. Emphasising algorithmic or computational aspects, this treatment of the geometry of folding and unfolding presents over 60 unsolved 'open problems' to spur further research. Polyèdres - Informatique Polyèdres - Modèles Datenverarbeitung Polyhedra Models Polyhedra Data processing Polyeder (DE-588)4132101-7 gnd rswk-swf Falten (DE-588)4153638-1 gnd rswk-swf Geometrie (DE-588)4020236-7 gnd rswk-swf Polyeder (DE-588)4132101-7 s Falten (DE-588)4153638-1 s Geometrie (DE-588)4020236-7 s DE-604 O'Rourke, Joseph 1951- Verfasser (DE-588)114449708 aut http://www.loc.gov/catdir/enhancements/fy0703/2006038156-d.html Publisher description http://www.loc.gov/catdir/enhancements/fy0703/2006038156-t.html Table of contents only HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015826302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Demaine, Erik D. 1981- O'Rourke, Joseph 1951- Geometric folding algorithms linkages, origami, polyhedra Polyèdres - Informatique Polyèdres - Modèles Datenverarbeitung Polyhedra Models Polyhedra Data processing Polyeder (DE-588)4132101-7 gnd Falten (DE-588)4153638-1 gnd Geometrie (DE-588)4020236-7 gnd |
| subject_GND | (DE-588)4132101-7 (DE-588)4153638-1 (DE-588)4020236-7 |
| title | Geometric folding algorithms linkages, origami, polyhedra |
| title_auth | Geometric folding algorithms linkages, origami, polyhedra |
| title_exact_search | Geometric folding algorithms linkages, origami, polyhedra |
| title_exact_search_txtP | Geometric folding algorithms linkages, origami, polyhedra |
| title_full | Geometric folding algorithms linkages, origami, polyhedra Erik D. Demaine, Joseph O'Rourke |
| title_fullStr | Geometric folding algorithms linkages, origami, polyhedra Erik D. Demaine, Joseph O'Rourke |
| title_full_unstemmed | Geometric folding algorithms linkages, origami, polyhedra Erik D. Demaine, Joseph O'Rourke |
| title_short | Geometric folding algorithms |
| title_sort | geometric folding algorithms linkages origami polyhedra |
| title_sub | linkages, origami, polyhedra |
| topic | Polyèdres - Informatique Polyèdres - Modèles Datenverarbeitung Polyhedra Models Polyhedra Data processing Polyeder (DE-588)4132101-7 gnd Falten (DE-588)4153638-1 gnd Geometrie (DE-588)4020236-7 gnd |
| topic_facet | Polyèdres - Informatique Polyèdres - Modèles Datenverarbeitung Polyhedra Models Polyhedra Data processing Polyeder Falten Geometrie |
| url | http://www.loc.gov/catdir/enhancements/fy0703/2006038156-d.html http://www.loc.gov/catdir/enhancements/fy0703/2006038156-t.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015826302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT demaineerikd geometricfoldingalgorithmslinkagesorigamipolyhedra AT orourkejoseph geometricfoldingalgorithmslinkagesorigamipolyhedra |