Author: Thomas C. Hull
Publisher: Cambridge University Press
ISBN: 1108805159
Category : Mathematics
Languages : en
Pages : 343
Book Description
Origami, the art of paper folding, has a rich mathematical theory. Early investigations go back to at least the 1930s, but the twenty-first century has seen a remarkable blossoming of the mathematics of folding. Besides its use in describing origami and designing new models, it is also finding real-world applications from building nano-scale robots to deploying large solar arrays in space. Written by a world expert on the subject, Origametry is the first complete reference on the mathematics of origami. It brings together historical results, modern developments, and future directions into a cohesive whole. Over 180 figures illustrate the constructions described while numerous 'diversions' provide jumping-off points for readers to deepen their understanding. This book is an essential reference for researchers of origami mathematics and its applications in physics, engineering, and design. Educators, students, and enthusiasts will also find much to enjoy in this fascinating account of the mathematics of folding.
Origametry
Author: Thomas C. Hull
Publisher: Cambridge University Press
ISBN: 1108805159
Category : Mathematics
Languages : en
Pages : 343
Book Description
Origami, the art of paper folding, has a rich mathematical theory. Early investigations go back to at least the 1930s, but the twenty-first century has seen a remarkable blossoming of the mathematics of folding. Besides its use in describing origami and designing new models, it is also finding real-world applications from building nano-scale robots to deploying large solar arrays in space. Written by a world expert on the subject, Origametry is the first complete reference on the mathematics of origami. It brings together historical results, modern developments, and future directions into a cohesive whole. Over 180 figures illustrate the constructions described while numerous 'diversions' provide jumping-off points for readers to deepen their understanding. This book is an essential reference for researchers of origami mathematics and its applications in physics, engineering, and design. Educators, students, and enthusiasts will also find much to enjoy in this fascinating account of the mathematics of folding.
Publisher: Cambridge University Press
ISBN: 1108805159
Category : Mathematics
Languages : en
Pages : 343
Book Description
Origami, the art of paper folding, has a rich mathematical theory. Early investigations go back to at least the 1930s, but the twenty-first century has seen a remarkable blossoming of the mathematics of folding. Besides its use in describing origami and designing new models, it is also finding real-world applications from building nano-scale robots to deploying large solar arrays in space. Written by a world expert on the subject, Origametry is the first complete reference on the mathematics of origami. It brings together historical results, modern developments, and future directions into a cohesive whole. Over 180 figures illustrate the constructions described while numerous 'diversions' provide jumping-off points for readers to deepen their understanding. This book is an essential reference for researchers of origami mathematics and its applications in physics, engineering, and design. Educators, students, and enthusiasts will also find much to enjoy in this fascinating account of the mathematics of folding.
Combinatorial Algorithms
Author: Thierry Lecroq
Publisher: Springer
ISBN: 3642452787
Category : Computers
Languages : en
Pages : 494
Book Description
This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.
Publisher: Springer
ISBN: 3642452787
Category : Computers
Languages : en
Pages : 494
Book Description
This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.
Graph Drawing and Network Visualization
Author: David Auber
Publisher: Springer Nature
ISBN: 303068766X
Category : Computers
Languages : en
Pages : 546
Book Description
This book constitutes the refereed proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2020, which was held during September 16-18, 2020. The conference was planned to take place in Vancouver, Canada, but changed to an online format due to the COVID-19 pandemic. The 29 full and 9 short papers presented in this volume were carefully reviewed and selected from 82 submissions. They were organized in topical sections named: gradient descent and queue layouts; drawing tree-like graphs, visualization, and special drawings of elementary graphs; restricted drawings of special graph classes; orthogonality; topological constraints; crossings, k-planar graphs; planarity; graphs drawing contest.
Publisher: Springer Nature
ISBN: 303068766X
Category : Computers
Languages : en
Pages : 546
Book Description
This book constitutes the refereed proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2020, which was held during September 16-18, 2020. The conference was planned to take place in Vancouver, Canada, but changed to an online format due to the COVID-19 pandemic. The 29 full and 9 short papers presented in this volume were carefully reviewed and selected from 82 submissions. They were organized in topical sections named: gradient descent and queue layouts; drawing tree-like graphs, visualization, and special drawings of elementary graphs; restricted drawings of special graph classes; orthogonality; topological constraints; crossings, k-planar graphs; planarity; graphs drawing contest.
Index of Conference Proceedings
Author: British Library. Document Supply Centre
Publisher:
ISBN:
Category : Conference proceedings
Languages : en
Pages : 870
Book Description
Publisher:
ISBN:
Category : Conference proceedings
Languages : en
Pages : 870
Book Description
Origami 4
Author: Robert J. Lang
Publisher: CRC Press
ISBN: 1439871043
Category : Mathematics
Languages : en
Pages : 566
Book Description
The connections between origami, mathematics, science, technology, and education have been a topic of considerable interest now for several decades. While many individuals have happened upon discrete connections among these fields during the twentieth century, the field really took off when previously isolated individuals began to make stronger con
Publisher: CRC Press
ISBN: 1439871043
Category : Mathematics
Languages : en
Pages : 566
Book Description
The connections between origami, mathematics, science, technology, and education have been a topic of considerable interest now for several decades. While many individuals have happened upon discrete connections among these fields during the twentieth century, the field really took off when previously isolated individuals began to make stronger con
Mathematical Reviews
Discrete and Computational Geometry
Author: Satyan L. Devadoss
Publisher: Princeton University Press
ISBN: 1400838983
Category : Mathematics
Languages : en
Pages : 270
Book Description
An essential introduction to discrete and computational geometry Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems. The essential introduction to discrete and computational geometry Covers traditional topics as well as new and advanced material Features numerous full-color illustrations, exercises, and unsolved problems Suitable for sophomores in mathematics, computer science, engineering, or physics Rigorous but accessible An online solutions manual is available (for teachers only)
Publisher: Princeton University Press
ISBN: 1400838983
Category : Mathematics
Languages : en
Pages : 270
Book Description
An essential introduction to discrete and computational geometry Discrete geometry is a relatively new development in pure mathematics, while computational geometry is an emerging area in applications-driven computer science. Their intermingling has yielded exciting advances in recent years, yet what has been lacking until now is an undergraduate textbook that bridges the gap between the two. Discrete and Computational Geometry offers a comprehensive yet accessible introduction to this cutting-edge frontier of mathematics and computer science. This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains. It also touches on more advanced material, including Dehn invariants, associahedra, quasigeodesics, Morse theory, and the recent resolution of the Poincaré conjecture. Connections to real-world applications are made throughout, and algorithms are presented independently of any programming language. This richly illustrated textbook also features numerous exercises and unsolved problems. The essential introduction to discrete and computational geometry Covers traditional topics as well as new and advanced material Features numerous full-color illustrations, exercises, and unsolved problems Suitable for sophomores in mathematics, computer science, engineering, or physics Rigorous but accessible An online solutions manual is available (for teachers only)
Data Depth
Author: Regina Y. Liu
Publisher: American Mathematical Soc.
ISBN: 0821835963
Category : Mathematics
Languages : en
Pages : 264
Book Description
The book is a collection of some of the research presented at the workshop of the same name held in May 2003 at Rutgers University. The workshop brought together researchers from two different communities: statisticians and specialists in computational geometry. The main idea unifying these two research areas turned out to be the notion of data depth, which is an important notion both in statistics and in the study of efficiency of algorithms used in computational geometry. Many of the articles in the book lay down the foundations for further collaboration and interdisciplinary research. Information for our distributors: Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).
Publisher: American Mathematical Soc.
ISBN: 0821835963
Category : Mathematics
Languages : en
Pages : 264
Book Description
The book is a collection of some of the research presented at the workshop of the same name held in May 2003 at Rutgers University. The workshop brought together researchers from two different communities: statisticians and specialists in computational geometry. The main idea unifying these two research areas turned out to be the notion of data depth, which is an important notion both in statistics and in the study of efficiency of algorithms used in computational geometry. Many of the articles in the book lay down the foundations for further collaboration and interdisciplinary research. Information for our distributors: Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1-7 were co-published with the Association for Computer Machinery (ACM).
Computational Geometry
Author: Mark de Berg
Publisher: Springer Science & Business Media
ISBN: 3662042452
Category : Computers
Languages : en
Pages : 370
Book Description
This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.
Publisher: Springer Science & Business Media
ISBN: 3662042452
Category : Computers
Languages : en
Pages : 370
Book Description
This introduction to computational geometry focuses on algorithms. Motivation is provided from the application areas as all techniques are related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.
Persistence Theory: From Quiver Representations to Data Analysis
Author: Steve Y. Oudot
Publisher: American Mathematical Soc.
ISBN: 1470434431
Category : Mathematics
Languages : en
Pages : 229
Book Description
Persistence theory emerged in the early 2000s as a new theory in the area of applied and computational topology. This book provides a broad and modern view of the subject, including its algebraic, topological, and algorithmic aspects. It also elaborates on applications in data analysis. The level of detail of the exposition has been set so as to keep a survey style, while providing sufficient insights into the proofs so the reader can understand the mechanisms at work. The book is organized into three parts. The first part is dedicated to the foundations of persistence and emphasizes its connection to quiver representation theory. The second part focuses on its connection to applications through a few selected topics. The third part provides perspectives for both the theory and its applications. The book can be used as a text for a course on applied topology or data analysis.
Publisher: American Mathematical Soc.
ISBN: 1470434431
Category : Mathematics
Languages : en
Pages : 229
Book Description
Persistence theory emerged in the early 2000s as a new theory in the area of applied and computational topology. This book provides a broad and modern view of the subject, including its algebraic, topological, and algorithmic aspects. It also elaborates on applications in data analysis. The level of detail of the exposition has been set so as to keep a survey style, while providing sufficient insights into the proofs so the reader can understand the mechanisms at work. The book is organized into three parts. The first part is dedicated to the foundations of persistence and emphasizes its connection to quiver representation theory. The second part focuses on its connection to applications through a few selected topics. The third part provides perspectives for both the theory and its applications. The book can be used as a text for a course on applied topology or data analysis.