Ryuhei Uehara – författare

A unique collection of papers illustrating the connections between origami and a wide range of fields. The papers compiled in this two-part set were presented at the 6th International Meeting on Origami in Science, Mathematics and Education (10-13 August 2014, Tokyo, Japan). They display the creative melding of origami (or, more broadly, folding) with fields ranging from cell biology to space exploration, from education to kinematics, from abstract mathematical laws to the artistic and aesthetics of sculptural design.This two-part book contains papers accessible to a wide audience, including those interested in art, design, history, and education and researchers interested in the connections between origami and science, technology, engineering, and mathematics. Part 1 contains papers on various aspects of mathematics of origami: coloring, constructability, rigid foldability, and design algorithms. Part 2 focuses on the connections between origami and more applied areas of science: engineering, physics, architecture, industrial design, and other artistic fields that go well beyond the usual folded paper.

A unique collection of papers illustrating the connections between origami and a wide range of fields. The papers compiled in this two-part set were presented at the 6th International Meeting on Origami in Science, Mathematics and Education (10-13 August 2014, Tokyo, Japan). They display the creative melding of origami (or, more broadly, folding) with fields ranging from cell biology to space exploration, from education to kinematics, from abstract mathematical laws to the artistic and aesthetics of sculptural design.This two-part book contains papers accessible to a wide audience, including those interested in art, design, history, and education and researchers interested in the connections between origami and science, technology, engineering, and mathematics. This Part 1 contains papers on various aspects of mathematics of origami: coloring, constructability, rigid foldability, and design algorithms.

A unique collection of papers illustrating the connections between origami and a wide range of fields. The papers compiled in this two-part set were presented at the 6th International Meeting on Origami in Science, Mathematics and Education (10-13 August 2014, Tokyo, Japan). They display the creative melding of origami (or, more broadly, folding) with fields ranging from cell biology to space exploration, from education to kinematics, from abstract mathematical laws to the artistic and aesthetics of sculptural design.This two-part book contains papers accessible to a wide audience, including those interested in art, design, history, and education and researchers interested in the connections between origami and science, technology, engineering, and mathematics. This Part 1 contains papers on various aspects of mathematics of origami: coloring, constructability, rigid foldability, and design algorithms.

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverseareas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.

This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018.The 22 full papers presented were carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.

This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.

These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents.Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics.

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.

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.

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents.