Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas. Among the presentations are recently discovered theorems on orthogonal polygons, polygons with holes, exterior visibility, visibility graphs, and visibility in three dimensions. The author formulates many open problems and offers several conjectures, providing arguments which may be followed by anyone familiar with basic graph theory and algorithms. This work may be applied to robotics and artificial intelligence as well as other fields, and will be especially useful to computer scientists working with computational and combinatorial geometry.

Art Gallery Theorems and Algorithms (International Series of Monographs on Computer Science)

Computers & Technology

O’Rourke, Joseph

Programming

Oxford University Press

How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

Demaine, Erik D.

Cambridge University Press

What do proteins and pop-up cards have in common? How is opening a grocery bag different from opening a gift box? How can you cut out the letters for a whole word all at once with one straight scissors cut? How many ways are there to flatten a cube? You can answer these questions and more through the mathematics of folding and unfolding. From this book, you will discover new and old mathematical theorems by folding paper and find out how to reason toward proofs. With the help of 200 color figures, author Joseph O'Rourke explains these fascinating folding problems starting from high school algebra and geometry and introducing more advanced concepts in tangible contexts as they arise. He shows how variations on these basic problems lead directly to the frontiers of current mathematical research and offers ten accessible unsolved problems for the enterprising reader. Before tackling these, you can test your skills on fifty exercises with complete solutions. The book's Web site, http://www.howtofoldit.org, has dynamic animations of many of the foldings and downloadable templates for readers to fold or cut out.

How to Fold It

Humor & Entertainment

Puzzles & Games

The basic techniques used in computational geometry--polygon triangulations, convex hulls, Voronoi diagrams, and arrangements--are all covered in the first textbook to appropriately introduce undergraduate students to the design of geometry algorithms.

Computational Geometry in C

Programming Languages

This is the newly revised and expanded edition of the popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The second edition contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new "Sources" chapter points to supplemental literature for readers needing more information on any topic. A novel aspect is the inclusion of working C code for many of the algorithms, with discussion of practical implementation issues. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The code in this new edition is significantly improved from the first edition, and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/~orourke/) or by anonymous ftp.

Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science (Paperback))

How can linkages, pieces of paper, and polyhedra be folded? The authors present hundreds of results and over 60 unsolved 'open problems' in this comprehensive look at the mathematics of folding, with an emphasis on algorithmic or computational aspects. Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s, but have only recently been studied in the mathematical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. A proof shows that it is possible to design a series of jointed bars moving only in a flat plane that can sign a name or trace any other algebraic curve. One remarkable algorithm shows you can fold any straight-line drawing on paper so that the complete drawing can be cut out with one straight scissors cut. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.

What do proteins and pop-up cards have in common? How is opening a grocery bag different from opening a gift box? How can you cut out the letters for a whole word all at once with one straight scissors cut? How many ways are there to flatten a cube? You can answer these questions and more through the mathematics of folding and unfolding. From this book, you will discover new and old mathematical theorems by folding paper and find out how to reason toward proofs. With the help of 200 color figures, author Joseph O'Rourke explains these fascinating folding problems starting from high school algebra and geometry and introducing more advanced concepts in tangible contexts as they arise. He shows how variations on these basic problems lead directly to the frontiers of current mathematical research and offers ten accessible unsolved problems for the enterprising reader. Before tackling these, you can test your skills on fifty exercises with complete solutions. The book's Web site, http://www.howtofoldit.org, has dynamic animations of many of the foldings and downloadable templates for readers to fold or cut out.

How to Fold It: The Mathematics of Linkages, Origami, and Polyhedra

Science & Math

Mathematics

See the best price to sell, buy, or rent books by O’Rourke, Joseph. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by O’Rourke, Joseph

See the best price to sell, buy, or rent books by O’Rourke, Joseph. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Art Gallery Theorems and Algorithms (International Series of Monographs on Computer Science)

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

How to Fold It

Computational Geometry in C

Computational Geometry in C

Computational Geometry in C

Computational Geometry in C (Cambridge Tracts in Theoretical Computer Science (Paperback))

Geometric Folding Algorithms: Linkages, Origami, Polyhedra

How to Fold It: The Mathematics of Linkages, Origami, and Polyhedra

Geometric Folding Algorithms: Linkages, Origami, Polyhedra