Overview
Introduces basic theorems and the latest research results
Focuses on origami from the point of view of computer science
Contains many unsolved problems, exercises, and answers to the exercises
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (12 chapters)
-
Introduction to Unfolding
-
Common Nets
-
Algorithm and Complexity of Folding
Keywords
About this book
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.
Authors and Affiliations
About the author
Bibliographic Information
Book Title: Introduction to Computational Origami
Book Subtitle: The World of New Computational Geometry
Authors: Ryuhei Uehara
DOI: https://doi.org/10.1007/978-981-15-4470-5
Publisher: Springer Singapore
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Singapore Pte Ltd. 2020
Hardcover ISBN: 978-981-15-4469-9Published: 30 June 2020
Softcover ISBN: 978-981-15-4472-9Published: 30 June 2021
eBook ISBN: 978-981-15-4470-5Published: 29 June 2020
Edition Number: 1
Number of Pages: XVIII, 220
Number of Illustrations: 107 b/w illustrations, 25 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Geometry, Mathematical and Computational Engineering