Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423636 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
Let P be an orthogonal polygon with n vertices, and let Vâ and Eâ be specified sets of vertices and edges of P. We prove that P has a guard set of cardinality at most â(n+3|Vâ|+2|Eâ|)/4â that includes each vertex in Vâ and at least one point of each edge in Eâ. Our bound is sharp and reduces to the orthogonal art gallery theorem of Kahn, Klawe and Kleitman when Vâ and Eâ are empty.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
T.S. Michael, Val Pinciu,