Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Introduction to Computational Origami -  Ryuhei Uehara

Introduction to Computational Origami (eBook)

The World of New Computational Geometry
eBook Download: PDF
2020 | 1st ed. 2020
XVIII, 220 Seiten
Springer Singapore (Verlag)
978-981-15-4470-5 (ISBN)
Systemvoraussetzungen
90,94 inkl. MwSt
(CHF 88,85)
Der eBook-Verkauf erfolgt durch die Lehmanns Media GmbH (Berlin) zum Preis in Euro inkl. MwSt.
  • Download sofort lieferbar
  • Zahlungsarten anzeigen
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.



Ryuhei Uehara is a professor in the School of Information Science at the Japan Advanced Institute of Science and Technology. After working as a researcher at Canon Inc., he joined Tokyo Woman's Christian University as an assistant professor. He was later a lecturer and associate professor at Komazawa University. He was a visiting scholar at the University of Waterloo (Canada), the Massachusetts Institute of Technology (USA), Simon Fraser University (Canada), Université libre de Bruxelles (Belgium), ETH  Zürich (Switzerland), and Universitat Politècnica de Catalunya (Spain).  His research interests include computational complexity, algorithms and data structures, and graph algorithms. He is especially engrossed in computational origami, games, and puzzles from the point of view of theoretical computer science. He is one of two translators of the New Martin Gardner Mathematical Library into Japanese.
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.
Erscheint lt. Verlag 29.6.2020
Zusatzinfo XVIII, 220 p. 132 illus., 25 illus. in color.
Sprache englisch
Themenwelt Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Geometrie / Topologie
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Technik Bauwesen
Schlagworte Algorithm analysis and problem complexity • algorithms • Computational Geometry • Computational Origami • Folding • Geometry • Origami • Unfolding
ISBN-10 981-15-4470-0 / 9811544700
ISBN-13 978-981-15-4470-5 / 9789811544705
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
PDFPDF (Wasserzeichen)
Größe: 7,3 MB

DRM: Digitales Wasserzeichen
Dieses eBook enthält ein digitales Wasser­zeichen und ist damit für Sie persona­lisiert. Bei einer missbräuch­lichen Weiter­gabe des eBooks an Dritte ist eine Rück­ver­folgung an die Quelle möglich.

Dateiformat: PDF (Portable Document Format)
Mit einem festen Seiten­layout eignet sich die PDF besonders für Fach­bücher mit Spalten, Tabellen und Abbild­ungen. Eine PDF kann auf fast allen Geräten ange­zeigt werden, ist aber für kleine Displays (Smart­phone, eReader) nur einge­schränkt geeignet.

Systemvoraussetzungen:
PC/Mac: Mit einem PC oder Mac können Sie dieses eBook lesen. Sie benötigen dafür einen PDF-Viewer - z.B. den Adobe Reader oder Adobe Digital Editions.
eReader: Dieses eBook kann mit (fast) allen eBook-Readern gelesen werden. Mit dem amazon-Kindle ist es aber nicht kompatibel.
Smartphone/Tablet: Egal ob Apple oder Android, dieses eBook können Sie lesen. Sie benötigen dafür einen PDF-Viewer - z.B. die kostenlose Adobe Digital Editions-App.

Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook-orders from other countries.

Mehr entdecken
aus dem Bereich
Build memory-efficient cross-platform applications using .NET Core

von Trevoir Williams

eBook Download (2024)
Packt Publishing (Verlag)
CHF 29,30
Learn asynchronous programming by building working examples of …

von Carl Fredrik Samson

eBook Download (2024)
Packt Publishing Limited (Verlag)
CHF 29,30