LEADER 03770nam  22005655  450 
001 996465443103316
005 20200705155711.0
010   $a981-15-4470-0
024 7 $a10.1007/978-981-15-4470-5
035   $a(CKB)4100000011325674
035   $a(MiAaPQ)EBC6241458
035   $a(DE-He213)978-981-15-4470-5
035   $a(PPN)248594087
035   $a(EXLCZ)994100000011325674
100   $a20200629d2020      u|             0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aIntroduction to Computational Origami$b[electronic resource] $eThe World of New Computational Geometry /$fby Ryuhei Uehara
205   $a1st ed. 2020.
210  1$aSingapore :$cSpringer Singapore :$cImprint: Springer,$d2020.
215   $a1 online resource (227 pages)
311   $a981-15-4469-7 
327   $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.
330   $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.
606   $aAlgorithms
606   $aGeometry
606   $aApplied mathematics
606   $aEngineering mathematics
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aGeometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21006
606   $aMathematical and Computational Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/T11006
615  0$aAlgorithms.
615  0$aGeometry.
615  0$aApplied mathematics.
615  0$aEngineering mathematics.
615 14$aAlgorithm Analysis and Problem Complexity.
615 24$aGeometry.
615 24$aMathematical and Computational Engineering.
676   $a004
700   $aUehara$b Ryuhei$4aut$4http://id.loc.gov/vocabulary/relators/aut$0943591
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996465443103316
996   $aIntroduction to Computational Origami$92129732
997   $aUNISA