|
เลขหมู่ |
QA447 .O76 1987 | ชื่อเรื่อง |
Art gallery theorems and algorithms / Joseph O'Rourke. | ผู้แต่ง |
O'Rourke, Joseph. | ISBN |
0195039653 (alk. paper) | พิมพลักษณ์ |
New York : Oxford University Press, 1987. | รูปเล่ม |
xiv, 282 p. : ill. ; 25 cm. | หมายเหตุ |
Contents: Polygon partitions -- Orthogonal polygons -- Mobile guards -- Miscellaneous shapes -- Holes -- Exterior visibility --Visibility graphs -- Visibility algorithms -- Minimal guard covers -- Three dimensions and miscellany. | หมายเหตุ |
Summary: 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 problemsand offers several conjectures, providing arguments which may be followed by anyone familiar with basic graph theoryand 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. | หัวเรื่อง |
Geometry--Data processing. | หัวเรื่อง |
Combinatorial geometry. |
|