Bookbot

International Series of Monographs on Computer Science - 3: Art Gallery Theorems and Algorithms

Parametre

  • 282 stránok
  • 10 hodin čítania

Viac o knihe

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.

Nákup knihy

International Series of Monographs on Computer Science - 3: Art Gallery Theorems and Algorithms, Joseph O'Rourke

Jazyk
Rok vydania
1987
product-detail.submit-box.info.binding
(pevná),
Stav knihy
Poškodená
Cena
55,06 €

Platobné metódy

Nikto zatiaľ neohodnotil.Ohodnotiť

Titul
International Series of Monographs on Computer Science - 3: Art Gallery Theorems and Algorithms
Jazyk
anglicky
Rok vydania
1987
Väzba
pevná
Počet strán
282
ISBN10
0195039653
ISBN13
9780195039658
Série
Anotácia
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.