On the number of guard edges of a polygon (Q1312196): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A combinatorial theorem in plane geometry / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A short proof of Chvatal's Watchman Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4099997 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational complexity of art gallery problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for Finding the Kernel of a Polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Galleries need fewer mobile guards: A variation on Chvatal's theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3799261 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5642510 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal algorithm for detecting weak visibility of a polygon / rank | |||
Normal rank | |||
Revision as of 11:33, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of guard edges of a polygon |
scientific article |
Statements
On the number of guard edges of a polygon (English)
0 references
19 January 1994
0 references
In a polygon (art gallery) an edge is called a guard edge if a mobile guard patrolling along the edge can see every point in the polygon. The authors prove that in a non-starshaped polygon there are at most 3 guard edges, and at most 6 if there are holes (3 on the outer boundary and 3 on one of the holes).
0 references
guards
0 references
visibility
0 references
art gallery
0 references
