Maggiori informazioni sul libro
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 onorthogonal 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. Thiswork 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.
Acquisto del libro
International Series of Monographs on Computer Science - 3: Art Gallery Theorems and Algorithms, Joseph O'Rourke
- Lingua
- Pubblicato
- 1987
- product-detail.submit-box.info.binding
- (Copertina rigida),
- Condizioni del libro
- Danneggiato
- Prezzo
- 55,06 €
Metodi di pagamento
Ancora nessuna valutazione.
- Titolo
- International Series of Monographs on Computer Science - 3: Art Gallery Theorems and Algorithms
- Lingua
- Inglese
- Autori
- Joseph O'Rourke
- Editore
- Oxford University Press
- Pubblicato
- 1987
- Formato
- Copertina rigida
- Pagine
- 282
- ISBN10
- 0195039653
- ISBN13
- 9780195039658
- Serie
- Descrizione
- 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 onorthogonal 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. Thiswork 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.