Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2210.12817 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916681578708992 |
|---|---|
| author | Stade, Jack |
| author_facet | Stade, Jack |
| contents | We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\exists\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial equations has a real solution. The art gallery problem asks whether there is a configuration of {\it guards} that together can see every point inside of an {\it art gallery} modeled by a simple polygon. The original version of this problem (which we call the point-point variant) was shown to be $\exists\mathbb{R}$-hard [Abrahamsen, Adamaszek, and Miltzow, JACM 2021], but the complexity of the variant where guards only need to guard the walls of the art gallery was left as an open problem. We show that this variant is also $\exists\mathbb{R}$-hard. Our techniques can also be used to greatly simplify the proof of $\exists\mathbb{R}$-hardness of the point-point art gallery problem. The gadgets in previous work could only be constructed by using a computer to find complicated rational coordinates with specific algebraic properties. All of our gadgets can be constructed by hand and can be verified with simple geometric arguments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_12817 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard Stade, Jack Computational Geometry We resolve the complexity of the point-boundary variant of the art gallery problem, showing that it is $\exists\mathbb{R}$-complete, meaning that it is equivalent under polynomial time reductions to deciding whether a system of polynomial equations has a real solution. The art gallery problem asks whether there is a configuration of {\it guards} that together can see every point inside of an {\it art gallery} modeled by a simple polygon. The original version of this problem (which we call the point-point variant) was shown to be $\exists\mathbb{R}$-hard [Abrahamsen, Adamaszek, and Miltzow, JACM 2021], but the complexity of the variant where guards only need to guard the walls of the art gallery was left as an open problem. We show that this variant is also $\exists\mathbb{R}$-hard. Our techniques can also be used to greatly simplify the proof of $\exists\mathbb{R}$-hardness of the point-point art gallery problem. The gadgets in previous work could only be constructed by using a computer to find complicated rational coordinates with specific algebraic properties. All of our gadgets can be constructed by hand and can be verified with simple geometric arguments. |
| title | The Point-Boundary Art Gallery Problem is $\exists\mathbb{R}$-hard |
| topic | Computational Geometry |
| url | https://arxiv.org/abs/2210.12817 |