東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Introduction to computational origam...

Uehara, Ryuhei.

FindBook

Google Book

Amazon

博客來

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.
出版者:	Singapore :Springer Singapore : : 2020.,
面頁冊數:	xviii, 220 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Computer science. -
電子資源:	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. - Singapore :Springer Singapore :2020. - xviii, 220 p. :ill., digital ;24 cm.

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:

523869
Computer science.

LC Class. No.: QA75 / .U44 2020

Dewey Class. No.: 004

Introduction to computational origami = the world of new computational geometry /
LDR:02780nmm a2200325 a 4500 001 2257879
003 DE-He213
005 20200705155711.0
006 m d
007 cr nn 008maaau
008 220420s2020 si s 0 eng d
020 $a 9789811544705 $q (electronic bk.)
020 $a 9789811544699 $q (paper)
024 7 $a 10.1007/978-981-15-4470-5 $2 doi
035 $a 978-981-15-4470-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA75 $b .U44 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 004 $2 23
090 $a QA75 $b .U22 2020
100 1 $a Uehara, Ryuhei. $3 1002469
245 1 0 $a Introduction to computational origami $h [electronic resource] : $b the world of new computational geometry / $c by Ryuhei Uehara.
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2020.
300 $a xviii, 220 p. : $b ill., digital ; $c 24 cm.
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 0 $a Computer science. $3 523869
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Geometry. $3 517251
650 2 4 $a Mathematical and Computational Engineering. $3 3226306
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-15-4470-5
950 $a Computer Science (SpringerNature-11645)