**Art Gallery Theorems and Algorithms**

by Joseph O'Rourke

**Publisher**: Oxford University Press 1987**ISBN/ASIN**: 0195039653**ISBN-13**: 9780195039658**Number of pages**: 296

**Description**:

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.

Download or read it online for free here:

**Download link**

(11MB, PDF)

## Similar books

**Mathematical Illustrations: A Manual of Geometry and PostScript**

by

**Bill Casselman**-

**Cambridge University Press**

The author gives an introduction to basic features of the PostScript language and shows how to use it for producing mathematical graphics. The book includes the discussion computer graphics and some comments on good style in mathematical illustration.

(

**14604**views)

**Axiom: The Scientific Computation System**

by

**Richard D. Jenks, Robert S. Sutor**-

**axiom-developer.org**

Axiom is a free general purpose computer algebra system. The book gives a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms developed by the symbolic computation community, and presents advanced techniques.

(

**15237**views)

**Vector Math for 3D Computer Graphics**

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.

(

**16999**views)

**An Architecture for Combinator Graph Reduction**

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.

(

**11423**views)