Sometimes Two Irrational Guards are Needed.
Saved in:
| Title: | Sometimes Two Irrational Guards are Needed. |
|---|---|
| Authors: | Meijer, Lucas1, Miltzow, Tillmann1 |
| Source: | Discrete Mathematics & Theoretical Computer Science (DMTCS). 2026, Vol. 28 Issue 2, p1-24. 24p. |
| Subjects: | Computational geometry, Rational points (Geometry) |
| Abstract: | In the art gallery problem, we are given a closed polygon P, with rational coordinates and an integer k. We are asked whether it is possible to find a set (of guards) G of size k such that any point p ∈ P is seen by a point in G. We say two points p, q see each other if the line segment pq is contained inside P. It was shown by Abrahamsen, Adamaszek, and Miltzow that there is a polygon that can be guarded with three guards, but requires four guards if the guards are required to have rational coordinates. In other words, an optimal solution of size three might need to be irrational. We show that an optimal solution of size two might need to be irrational. Note that it is well-known that any polygon that can be guarded with one guard has an optimal guard placement with rational coordinates. Hence, our work closes the gap on when irrational guards are possible to occur. [ABSTRACT FROM AUTHOR] |
| Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
