Computational complexity of art gallery problems (Q3723700)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3954273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of art gallery problems |
scientific article; zbMATH DE number 3954273 |
Statements
Computational complexity of art gallery problems (English)
0 references
1986
0 references
computational geometry
0 references
minimum number of vertex guards
0 references
n-wall simply connected art gallery
0 references
NP-hard
0 references
minimum number of edge guards
0 references
minimum number of point guards
0 references
simply connected polygonal region
0 references
simply polygon
0 references
star-shaped polygons
0 references
0.863791286945343
0 references
0.8477449417114258
0 references
