| 000 | 03675nam a22005295i 4500 | ||
|---|---|---|---|
| 001 | 978-981-15-4470-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125012.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 200629s2020 si | s |||| 0|eng d | ||
| 020 |
_a9789811544705 _9978-981-15-4470-5 |
||
| 024 | 7 |
_a10.1007/978-981-15-4470-5 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a518.1 _223 |
| 100 | 1 |
_aUehara, Ryuhei. _eauthor. _0(orcid)0000-0003-0895-3765 _1https://orcid.org/0000-0003-0895-3765 _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 245 | 1 | 0 |
_aIntroduction to Computational Origami _h[electronic resource] : _bThe World of New Computational Geometry / _cby Ryuhei Uehara. |
| 250 | _a1st ed. 2020. | ||
| 264 | 1 |
_aSingapore : _bSpringer Nature Singapore : _bImprint: Springer, _c2020. |
|
| 300 |
_aXVIII, 220 p. 132 illus., 25 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 505 | 0 | _aChapter 1: Unfolding -- Chapter 2: Basic Knowledge of Unfolding -- Chapter 3: Common Nets of Boxes -- Chapter 4: Common Nets of (Regular) Polyhedra -- Chapter 5: One-Dimensional Origami Model and Stamp Folding -- Chapter 6: Computational Complexity of Stamp Folding -- Chapter 7: Bumpy Pyramids Folded from Petal Polygons -- Chapter 8: Zipper-Unfolding -- Chapter 9:Rep-cube -- Chapter 10: Common Nets of a Regular Tetrahedron and Johnson-Zalgaller Solids -- Chapter 11: Undecidability of Folding -- Chapter 12: Answers to Exercises. | |
| 520 | _aThis book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science. Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter. The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami. | ||
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aGeometry. | |
| 650 | 0 | _aEngineering mathematics. | |
| 650 | 0 |
_aEngineering _xData processing. |
|
| 650 | 1 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aGeometry. |
| 650 | 2 | 4 | _aMathematical and Computational Engineering Applications. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9789811544699 |
| 776 | 0 | 8 |
_iPrinted edition: _z9789811544712 |
| 776 | 0 | 8 |
_iPrinted edition: _z9789811544729 |
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-981-15-4470-5 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 942 | _cSPRINGER | ||
| 999 |
_c173117 _d173117 |
||