Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
museum problem
|
| gptkbp:application |
computer graphics
robotics surveillance |
| gptkbp:citation |
V. Chvátal, 'A combinatorial theorem in plane geometry', J. Combinatorial Theory Ser. B, 1975
|
| gptkbp:classicResult |
⌊n/3⌋ guards are sufficient and sometimes necessary for a simple polygon with n vertices
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describes |
How many guards are sufficient to observe every point in an art gallery represented as a polygon?
|
| gptkbp:field |
gptkb:geometry
|
| gptkbp:formedBy |
gptkb:Václav_Chvátal
1973 |
| gptkbp:generalizes |
gptkb:vertex_guards
3D art gallery problem edge guards mobile guards point guards |
| https://www.w3.org/2000/01/rdf-schema#label |
art gallery problem
|
| gptkbp:relatedTo |
gptkb:edge_guard_problem
gptkb:vertex_guard_problem polygon triangulation visibility graph |
| gptkbp:bfsParent |
gptkb:Joseph_O'Rourke
|
| gptkbp:bfsLayer |
5
|