國立虎尾科技大學 |

Introduction to Computational Origami = The World of New Computational Geometry /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Introduction to Computational Origami/ by Ryuhei Uehara.
其他題名:	The World of New Computational Geometry /
作者:	Uehara, Ryuhei.
面頁冊數:	XVIII, 220 p. 132 illus., 25 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical and Computational Engineering. -
電子資源:	https://doi.org/10.1007/978-981-15-4470-5
ISBN:	9789811544705

Introduction to Computational Origami = The World of New Computational Geometry /
Uehara, Ryuhei.

Introduction to Computational OrigamiThe World of New Computational Geometry /[electronic resource] :by Ryuhei Uehara. - 1st ed. 2020. - XVIII, 220 p. 132 illus., 25 illus. in color.online resource.

Chapter 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.

This 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.

ISBN: 9789811544705

Standard No.: 10.1007/978-981-15-4470-5doiSubjects--Topical Terms:

1139415
Mathematical and Computational Engineering.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Introduction to Computational Origami = The World of New Computational Geometry /
LDR:03146nam a22003975i 4500 001 1018444
003 DE-He213
005 20200705155711.0
007 cr nn 008mamaa
008 210318s2020 si | s |||| 0|eng d
020 $a 9789811544705 $9 978-981-15-4470-5
024 7 $a 10.1007/978-981-15-4470-5 $2 doi
035 $a 978-981-15-4470-5
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Uehara, Ryuhei. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 897136
245 1 0 $a Introduction to Computational Origami $h [electronic resource] : $b The World of New Computational Geometry / $c by Ryuhei Uehara.
250 $a 1st ed. 2020.
264 1 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2020.
300 $a XVIII, 220 p. 132 illus., 25 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Chapter 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 $a This 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 2 4 $a Mathematical and Computational Engineering. $3 1139415
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Engineering mathematics. $3 562757
650 0 $a Applied mathematics. $3 1069907
650 0 $a Geometry. $3 579899
650 0 $a Algorithms. $3 527865
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789811544699
776 0 8 $i Printed edition: $z 9789811544712
776 0 8 $i Printed edition: $z 9789811544729
856 4 0 $u https://doi.org/10.1007/978-981-15-4470-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)