Art gallery theorems and algorithms / Joseph O'Rourke.
By: O'Rourke, Joseph
.
Material type: 
BookSeries: International series of monographs on computer science: 3.Publisher: New York : Oxford University Press, 1987Description: xiv, 282 p. : ill. ; 25 cm. + hbk.ISBN: 0195039653.Subject(s): Geometry -- Data processing | Combinatorial geometryDDC classification: 516.00285 | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 516.00285 (Browse shelf(Opens below)) | 1 | Available | 00024731 |
Enhanced descriptions from Syndetics:
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.
Includes bibliographical references (pages 268-272) and index.
Polygon partitions -- Orthogonal polygons -- Mobile guards -- Miscellaneous shapes -- Holes -- Exterior visibility -- Visibility graphs -- Visibility algorithms -- Minimal guard covers -- Three dimensions and miscellany.
Table of contents provided by Syndetics
- 1 Polygon Partitions
- 2 Orthogonal Polygons
- 3 Mobile Guards
- 4 Miscellaneous Shapes
- 5 Holes
- 6 Exterior Visibility
- 7 Visibility Groups
- 8 Visibility Algorithms
- 9 Minimal Guard Covers
- 10 Three-Dimensions and Miscellany