Art Gallery Theorems and Algorithms
by Joseph O'Rourke
Publisher: Oxford University Press 1987
Number of pages: 296
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. 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.
Home page url
Download or read it online for free here:
by T. Nipkow, L.C. Paulson, M. Wenzel - Springer
This book is a self-contained introduction to interactive proof in higher-order logic, using the proof assistant Isabelle. It is a tutorial for potential users. The book has three parts: Elementary Techniques; Logic and Sets; Advanced Material.
by Jonathan M. Borwein - DocServer
The desire to understand Pi, the challenge, and originally the need, to calculate ever more accurate values of Pi, has challenged mathematicians for many many centuries, and Pi has provided compelling examples of computational mathematics.
by S. Basu, R. Pollack, M. Roy - Springer
The monograph gives a detailed exposition of the algorithmic real algebraic geometry. It is well written and will be useful both for beginners and for advanced readers, who work in real algebraic geometry or apply its methods in other fields.
The aim of this text is to develop an informal, light introduction to the world of fractal geometry and to inspire further research into the subject, whether your interest is of a pure, applied or even recreational nature.