The Art Gallery Problem is $\exists \mathbb{R}$-complete
We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classical problem in computational geometry. Given a simple polygon $P$ and an integer $k$, the...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
23.04.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We prove that the art gallery problem is equivalent under polynomial time
reductions to deciding whether a system of polynomial equations over the real
numbers has a solution. The art gallery problem is a classical problem in
computational geometry. Given a simple polygon $P$ and an integer $k$, the goal
is to decide if there exists a set $G$ of $k$ guards within $P$ such that every
point $p\in P$ is seen by at least one guard $g\in G$. Each guard corresponds
to a point in the polygon $P$, and we say that a guard $g$ sees a point $p$ if
the line segment $pg$ is contained in $P$.
The art gallery problem has stimulated extensive research in geometry and in
algorithms. However, the complexity status of the art gallery problem has not
been resolved. It has long been known that the problem is $\text{NP}$-hard, but
no one has been able to show that it lies in $\text{NP}$. Recently, the
computational geometry community became more aware of the complexity class
$\exists \mathbb{R}$. The class $\exists \mathbb{R}$ consists of problems that
can be reduced in polynomial time to the problem of deciding whether a system
of polynomial equations with integer coefficients and any number of real
variables has a solution. It can be easily seen that $\text{NP}\subseteq
\exists \mathbb{R}$. We prove that the art gallery problem is $\exists
\mathbb{R}$-complete, implying that (1) any system of polynomial equations over
the real numbers can be encoded as an instance of the art gallery problem, and
(2) the art gallery problem is not in the complexity class $\text{NP}$ unless
$\text{NP}=\exists \mathbb{R}$. As a corollary of our construction, we prove
that for any real algebraic number $\alpha$ there is an instance of the art
gallery problem where one of the coordinates of the guards equals $\alpha$ in
any guard set of minimum cardinality. That rules out many geometric approaches
to the problem. |
---|---|
AbstractList | We prove that the art gallery problem is equivalent under polynomial time
reductions to deciding whether a system of polynomial equations over the real
numbers has a solution. The art gallery problem is a classical problem in
computational geometry. Given a simple polygon $P$ and an integer $k$, the goal
is to decide if there exists a set $G$ of $k$ guards within $P$ such that every
point $p\in P$ is seen by at least one guard $g\in G$. Each guard corresponds
to a point in the polygon $P$, and we say that a guard $g$ sees a point $p$ if
the line segment $pg$ is contained in $P$.
The art gallery problem has stimulated extensive research in geometry and in
algorithms. However, the complexity status of the art gallery problem has not
been resolved. It has long been known that the problem is $\text{NP}$-hard, but
no one has been able to show that it lies in $\text{NP}$. Recently, the
computational geometry community became more aware of the complexity class
$\exists \mathbb{R}$. The class $\exists \mathbb{R}$ consists of problems that
can be reduced in polynomial time to the problem of deciding whether a system
of polynomial equations with integer coefficients and any number of real
variables has a solution. It can be easily seen that $\text{NP}\subseteq
\exists \mathbb{R}$. We prove that the art gallery problem is $\exists
\mathbb{R}$-complete, implying that (1) any system of polynomial equations over
the real numbers can be encoded as an instance of the art gallery problem, and
(2) the art gallery problem is not in the complexity class $\text{NP}$ unless
$\text{NP}=\exists \mathbb{R}$. As a corollary of our construction, we prove
that for any real algebraic number $\alpha$ there is an instance of the art
gallery problem where one of the coordinates of the guards equals $\alpha$ in
any guard set of minimum cardinality. That rules out many geometric approaches
to the problem. |
Author | Miltzow, Tillmann Abrahamsen, Mikkel Adamaszek, Anna |
Author_xml | – sequence: 1 givenname: Mikkel surname: Abrahamsen fullname: Abrahamsen, Mikkel – sequence: 2 givenname: Anna surname: Adamaszek fullname: Adamaszek, Anna – sequence: 3 givenname: Tillmann surname: Miltzow fullname: Miltzow, Tillmann |
BackLink | https://doi.org/10.48550/arXiv.1704.06969$$DView paper in arXiv |
BookMark | eNotj0FLwzAYQHPQg05_gCdz2LX1a5ukX45j6BQGiu44KF-Sr6yQriMtsiH-d3F6erfHe9fiYj_sWYi7AnKFWsMDpWP3mRc1qByMNfZK4GbHcpEmuaIYOZ3kWxpc5F52o5xv-diN0yi3PU07577ev-eZH_pD5IlvxGVLceTbf87Ex9PjZvmcrV9XL8vFOiNT28xbQNShRFa6JYbSKsQavSoLg8YEtKDRBCLvVAWBOfiqdWTBqJpKqmbi_s96Lm8OqespnZrfg-Z8UP0AWhtBqg |
ContentType | Journal Article |
Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
DBID | AKY GOX |
DOI | 10.48550/arxiv.1704.06969 |
DatabaseName | arXiv Computer Science arXiv.org |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
ExternalDocumentID | 1704_06969 |
GroupedDBID | AKY GOX |
ID | FETCH-LOGICAL-a679-c90885d28e45fae02948878c4216866d890586daacb430deedc3fba90647a2a3 |
IEDL.DBID | GOX |
IngestDate | Mon Jan 08 05:38:37 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a679-c90885d28e45fae02948878c4216866d890586daacb430deedc3fba90647a2a3 |
OpenAccessLink | https://arxiv.org/abs/1704.06969 |
ParticipantIDs | arxiv_primary_1704_06969 |
PublicationCentury | 2000 |
PublicationDate | 2017-04-23 |
PublicationDateYYYYMMDD | 2017-04-23 |
PublicationDate_xml | – month: 04 year: 2017 text: 2017-04-23 day: 23 |
PublicationDecade | 2010 |
PublicationYear | 2017 |
Score | 1.6590579 |
SecondaryResourceType | preprint |
Snippet | We prove that the art gallery problem is equivalent under polynomial time
reductions to deciding whether a system of polynomial equations over the real
numbers... |
SourceID | arxiv |
SourceType | Open Access Repository |
SubjectTerms | Computer Science - Computational Geometry |
Title | The Art Gallery Problem is $\exists \mathbb{R}$-complete |
URI | https://arxiv.org/abs/1704.06969 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV1LS8QwEB529-RFFJX1SQ69BtM0TTNHEXcXwQc-oIeFkkeDexFpV1HE_27SVvTiNZlLZgjfFzLzfQAJCnSBJiuaceOpEMJRk9ZIo6eD8R6xYHEa-epaLh7FZZmXIyA_szC6eV-99frApj1NiyhDKlHiGMacx5at-U3Zf052UlxD_G9c4Jjd0h-QmG3B5sDuyFlfjm0Y1c87oEIp4hKZR9-S5oPc9iYuZNWSZBmlKNctWQbm-GTM591XQrs270Bmd-F-dvFwvqCDYQHVskBqY89Q7riqRe51zTiG21EoK3gqlZROIcuVdFpbIzLmAjrZzBuNcd5Tc53twSQ8-espEMcww8AMjLa5MM4o7QUWunCWW858vg_T7pTVSy9JUcUEVF0CDv7fOoQNHkGJCcqzI5ism9f6OEDq2px0ef0Gq6l1tg |
link.rule.ids | 228,230,786,891 |
linkProvider | Cornell University |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Art+Gallery+Problem+is+%24%5Cexists+%5Cmathbb%7BR%7D%24-complete&rft.au=Abrahamsen%2C+Mikkel&rft.au=Adamaszek%2C+Anna&rft.au=Miltzow%2C+Tillmann&rft.date=2017-04-23&rft_id=info:doi/10.48550%2Farxiv.1704.06969&rft.externalDocID=1704_06969 |