Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
simple polygons
|
| gptkbp:field |
gptkb:geometry
gptkb:mathematics |
| gptkbp:hasApplication |
computer graphics
robotics surveillance |
| https://www.w3.org/2000/01/rdf-schema#label |
Klee's art gallery theorem
|
| gptkbp:namedAfter |
gptkb:Victor_Klee
|
| gptkbp:provenBy |
gptkb:Václav_Chvátal
|
| gptkbp:publishedIn |
gptkb:Discrete_&_Computational_Geometry
|
| gptkbp:relatedConcept |
gptkb:art_gallery_problem
polygon triangulation |
| gptkbp:state |
For a simple polygon with n vertices, ⌊n/3⌋ guards are sufficient to cover the interior.
|
| gptkbp:yearProposed |
1973
|
| gptkbp:bfsParent |
gptkb:Victor_Klee
|
| gptkbp:bfsLayer |
5
|