The orthogonal art gallery theorem with constrained guards
Resource type
Authors/contributors
- Michael, T S (Author)
- Pinciu, Val (Author)
Title
The orthogonal art gallery theorem with constrained guards
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. © 2016 Elsevier B.V.
Publication
Electronic Notes in Discrete Mathematics
Date
2016
Volume
54
Pages
27-32
Journal Abbr
Electron. Notes Discrete Math.
Citation Key
pop00362
ISSN
15710653 (ISSN)
Language
English
Extra
0 citations (Crossref) [2023-10-31]
Citation Key Alias: lens.org/018-020-908-114-676
tex.type: [object Object]
Citation
Michael, T. S., & Pinciu, V. (2016). The orthogonal art gallery theorem with constrained guards. Electronic Notes in Discrete Mathematics, 54, 27–32. https://doi.org/10.1016/j.endm.2016.09.006
Link to this record