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 Bradley Kjell - Central Connecticut State University
A text on vector and matrix algebra from the viewpoint of computer graphics. It covers most vector and matrix topics needed for college-level computer graphics text books. Useful to computer science students interested in game programming.
by Philip J. Koopman, Jr. - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
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.
by Gareth J. Janacek, Mark L. Close - BookBoon
In this textbook you will find the basic mathematics needed by computer scientists. It should help you to understand the meaning of mathematical concepts. Subjects as elementary logic, factorization, plotting functions and matrices are explained.