LIPIcs.ESA.2024.27.pdf
- Filesize: 0.51 MB
- 4 pages
Document
Art Galleries and Mobile Guards: Revisiting O'Rourke’s Proof
Author
-
Part of:
Volume:
32nd Annual European Symposium on Algorithms (ESA 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: European Symposium on Algorithms (ESA) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-09-23
Cite AsGet BibTex
Ahmad Biniaz. Art Galleries and Mobile Guards: Revisiting O'Rourke’s Proof. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 27:1-27:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ESA.2024.27
https://doi.org/10.4230/LIPIcs.ESA.2024.27
Abstract
O'Rourke (1983) proved that every n-vertex polygon, with n ≥ 4, can be guarded by ⌊ n/4⌋ edges or diagonals - a variant of Chvátal’s theorem for sufficiency of ⌊ n/3⌋ vertices. We present a short proof for a somewhat stronger result that allows us to impose some constraints on the guards. We prove that for every given subset V of vertices, the polygon can be guarded by ⌊(n+2|V|)/4⌋ edges or diagonals that include at least one edge or diagonal incident to every vertex of V. This bound is the best achievable given the constraint for V. Our proof is by induction and suggests a simple linear-time algorithm after triangulating the polygon. The sufficiency of ⌊4⌋ guards is a special case of the new result where V is the empty set.
Subject Classification
ACM Subject Classification
- Theory of computation → Computational geometry
Keywords
- Polygon guarding
- Edge guarding
- Short proof
- Simple algorithm
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Mikkel Abrahamsen, Anna Adamaszek, and Tillmann Miltzow. The art gallery problem is ∃ℝ-complete. Journal of the ACM, 69(1):4:1-4:70, 2022. Also in STOC 2018.
-
Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour, and Ziting Yu. Guarding orthogonal art galleries with sliding k-transmitters: Hardness and approximation. Algorithmica, 81(1):69-97, 2019.
-
Bernard Chazelle. Triangulating a simple polygon in linear time. Discrete & Computational Geometry, 6:485-524, 1991. Also in FOCS 1990.
-
Vasek Chvátal. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B, 18(1):39-41, 1975.
-
Steve Fisk. A short proof of Chvátal’s watchman theorem. Journal of Combinatorial Theory, Series B, 24(3):374, 1978.
-
T. S. Michael and Val Pinciu. The art gallery theorem, revisited. The American Mathematical Monthly, 123(8):802-807, 2016.
-
Joseph O'Rourke. Galleries need fewer mobile guards: A variation on Chvátal’s theorem. Geometriae Dedicata, 14:273-283, 1983.
-
Joseph O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, 1987.
-
Thomas C. Shermer. Recent results in art galleries. Proceedings of the IEEE, 80(9):1384-1399, 1992.
-
Csaba D. Tóth, Godfried T. Toussaint, and Andrew Winslow. Open guard edges and edge guards in simple polygons. In Proc. of the 23rd Canadian Conference on Computational Geometry, CCCG, 2011.