| LEADER : 00000nam 2200000uu 4500 |
| 008 180118s1987||||th 000 0 eng d |
| 020 ^a0195039653 (alk. paper) |
| 050 0 ^aQA447^b.O76 1987 |
| 100 1 ^aO'Rourke, Joseph. |
| 245 10 ^aArt gallery theorems and algorithms /^cJoseph O'Rourke. |
| 260 ^aNew York :^bOxford University Press,^c1987. |
| 300 ^axiv, 282 p. :^bill. ;^c25 cm. |
| 490 1 ^aThe International series of monographs on computer science;^v3 |
| 504 ^aIncludes bibliographical references (p. 268-272) andindex. |
| 505 0 ^aPolygon partitions -- Orthogonal polygons -- Mobile guards-- Miscellaneous shapes -- Holes -- Exterior visibility --Visibility graphs -- Visibility algorithms -- Minimal guard covers -- Three dimensions and miscellany. |
| 520 ^aArt 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. |
| 650 0 ^aGeometry^xData processing. |
| 650 0 ^aCombinatorial geometry. |
| 999 ^aปวีนา ภู่ทอง |
แสดงรายละเอียดบรรณานุกรม
< ปิดหน้าต่าง
ขอยืม
