A Practical Algorithm with Performance Guarantees for the Art Gallery Problem
Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a minimum size set $G\subset P$ of guards that sees $P$ completely. The only currently correct algorithm to solve the art gallery problem exactly use...
Saved in:
| Published in: | Discrete mathematics and theoretical computer science Vol. 25:2; no. Discrete Algorithms |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
24.06.2024
|
| Subjects: | |
| ISSN: | 1365-8050, 1365-8050 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Given a closed simple polygon $P$, we say two points $p,q$ see each other if
the segment $pq$ is fully contained in $P$. The art gallery problem seeks a
minimum size set $G\subset P$ of guards that sees $P$ completely. The only
currently correct algorithm to solve the art gallery problem exactly uses
algebraic methods and is attributed to Sharir. As the art gallery problem is
ER-complete, it seems unlikely to avoid algebraic methods, without additional
assumptions. In this paper, we introduce the notion of vision stability. In
order to describe vision stability consider an enhanced guard that can see
"around the corner" by an angle of $\delta$ or a diminished guard whose vision
is by an angle of $\delta$ "blocked" by reflex vertices. A polygon $P$ has
vision stability $\delta$ if the optimal number of enhanced guards to guard $P$
is the same as the optimal number of diminished guards to guard $P$. We will
argue that most relevant polygons are vision stable. We describe a one-shot
vision stable algorithm that computes an optimal guard set for visionstable
polygons using polynomial time and solving one integer program. It guarantees
to find the optimal solution for every vision stable polygon. We implemented an
iterative visionstable algorithm and show its practical performance is slower,
but comparable with other state of the art algorithms. Our iterative algorithm
is inspired and follows closely the one-shot algorithm. It delays several steps
and only computes them when deemed necessary. Given a chord $c$ of a polygon,
we denote by $n(c)$ the number of vertices visible from $c$. The chord-width of
a polygon is the maximum $n(c)$ over all possible chords $c$. The set of vision
stable polygons admits an FPT algorithm when parametrized by the chord-width.
Furthermore, the one-shot algorithm runs in FPT time, when parameterized by the
number of reflex vertices. |
|---|---|
| AbstractList | Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a minimum size set $G\subset P$ of guards that sees $P$ completely. The only currently correct algorithm to solve the art gallery problem exactly uses algebraic methods and is attributed to Sharir. As the art gallery problem is ER-complete, it seems unlikely to avoid algebraic methods, without additional assumptions. In this paper, we introduce the notion of vision stability. In order to describe vision stability consider an enhanced guard that can see "around the corner" by an angle of $\delta$ or a diminished guard whose vision is by an angle of $\delta$ "blocked" by reflex vertices. A polygon $P$ has vision stability $\delta$ if the optimal number of enhanced guards to guard $P$ is the same as the optimal number of diminished guards to guard $P$. We will argue that most relevant polygons are vision stable. We describe a one-shot vision stable algorithm that computes an optimal guard set for visionstable polygons using polynomial time and solving one integer program. It guarantees to find the optimal solution for every vision stable polygon. We implemented an iterative visionstable algorithm and show its practical performance is slower, but comparable with other state of the art algorithms. Our iterative algorithm is inspired and follows closely the one-shot algorithm. It delays several steps and only computes them when deemed necessary. Given a chord $c$ of a polygon, we denote by $n(c)$ the number of vertices visible from $c$. The chord-width of a polygon is the maximum $n(c)$ over all possible chords $c$. The set of vision stable polygons admits an FPT algorithm when parametrized by the chord-width. Furthermore, the one-shot algorithm runs in FPT time, when parameterized by the number of reflex vertices. Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a minimum size set $G\subset P$ of guards that sees $P$ completely. The only currently correct algorithm to solve the art gallery problem exactly uses algebraic methods and is attributed to Sharir. As the art gallery problem is ER-complete, it seems unlikely to avoid algebraic methods, without additional assumptions. In this paper, we introduce the notion of vision stability. In order to describe vision stability consider an enhanced guard that can see "around the corner" by an angle of $\delta$ or a diminished guard whose vision is by an angle of $\delta$ "blocked" by reflex vertices. A polygon $P$ has vision stability $\delta$ if the optimal number of enhanced guards to guard $P$ is the same as the optimal number of diminished guards to guard $P$. We will argue that most relevant polygons are vision stable. We describe a one-shot vision stable algorithm that computes an optimal guard set for visionstable polygons using polynomial time and solving one integer program. It guarantees to find the optimal solution for every vision stable polygon. We implemented an iterative visionstable algorithm and show its practical performance is slower, but comparable with other state of the art algorithms. Our iterative algorithm is inspired and follows closely the one-shot algorithm. It delays several steps and only computes them when deemed necessary. Given a chord $c$ of a polygon, we denote by $n(c)$ the number of vertices visible from $c$. The chord-width of a polygon is the maximum $n(c)$ over all possible chords $c$. The set of vision stable polygons admits an FPT algorithm when parametrized by the chord-width. Furthermore, the one-shot algorithm runs in FPT time, when parameterized by the number of reflex vertices. |
| Author | Hengeveld, Simon Miltzow, Tillmann |
| Author_xml | – sequence: 1 givenname: Simon surname: Hengeveld fullname: Hengeveld, Simon – sequence: 2 givenname: Tillmann surname: Miltzow fullname: Miltzow, Tillmann |
| BookMark | eNpNkE1Lw0AURQepYFtd-QdmL6nzkZlklqFoW6jYha6Hl8mbNiXJyCQi_ffGVsTNu4-7OHDPjEy60CEh95wtUi1M_li1g-sXRgh1RaZcapXkTLHJv_-GzPr-yBgXJs2m5KWguwhuqB00tGj2IdbDoaVf46U7jD7EFjqHdPUJEboBsadjR4cD0iIOdAVNg_E0MkLZYHtLrj00Pd795py8Pz-9LdfJ9nW1WRbbxAlmVGJK4TRjEkymUJaVYp4pmXuvRCYxVcKIlBsJvuQsV6XyEsEppjhqobECOSebC7cKcLQfsW4hnmyA2p6LEPcW4ripQYsyZ1ojFzLL0jLzOc8hk0o7AeWoIB1ZDxeWi6HvI_o_Hmf2bNWerdofq_Ib5pxrdQ |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/dmtcs.9225 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Open Access Full Text url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1365-8050 |
| ExternalDocumentID | oai_doaj_org_article_e38066e123774b7f818a7356c2ab2944 10_46298_dmtcs_9225 |
| GroupedDBID | -~9 .4S .DC 29G 2WC 5GY 5VS 8FE 8FG AAFWJ AAYXX ABDBF ABJCF ABUWG ACGFO ACIWK ACUHS ADBBV ADQAK AENEX AFFHD AFKRA AFPKN AIAGR ALMA_UNASSIGNED_HOLDINGS AMVHM ARCSS B0M BAIFH BBTPI BCNDV BENPR BFMQW BGLVJ BPHCQ CCPQU CITATION EAP EBS ECS EDO EJD EMK EPL EST ESX GROUPED_DOAJ HCIFZ I-F IAO IBB ICD ITC J9A KQ8 KWQ L6V M7S MK~ ML~ OK1 OVT P2P PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PV9 REM RNS RSU RZL TR2 TUS XSB ~8M |
| ID | FETCH-LOGICAL-c2095-9b2c6003a975e3bd50f0538ff5273e452924193afb1085b5f3eac5051e626eda3 |
| IEDL.DBID | DOA |
| ISSN | 1365-8050 |
| IngestDate | Fri Oct 03 12:23:42 EDT 2025 Sat Nov 29 02:48:27 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Discrete Algorithms |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2095-9b2c6003a975e3bd50f0538ff5273e452924193afb1085b5f3eac5051e626eda3 |
| OpenAccessLink | https://doaj.org/article/e38066e123774b7f818a7356c2ab2944 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_e38066e123774b7f818a7356c2ab2944 crossref_primary_10_46298_dmtcs_9225 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-06-24 |
| PublicationDateYYYYMMDD | 2024-06-24 |
| PublicationDate_xml | – month: 06 year: 2024 text: 2024-06-24 day: 24 |
| PublicationDecade | 2020 |
| PublicationTitle | Discrete mathematics and theoretical computer science |
| PublicationYear | 2024 |
| Publisher | Discrete Mathematics & Theoretical Computer Science |
| Publisher_xml | – name: Discrete Mathematics & Theoretical Computer Science |
| SSID | ssj0012947 |
| Score | 2.306052 |
| Snippet | Given a closed simple polygon $P$, we say two points $p,q$ see each other if
the segment $pq$ is fully contained in $P$. The art gallery problem seeks a... Given a closed simple polygon $P$, we say two points $p,q$ see each other if the segment $pq$ is fully contained in $P$. The art gallery problem seeks a... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - computational geometry computer science - data structures and algorithms computer science - discrete mathematics |
| Title | A Practical Algorithm with Performance Guarantees for the Art Gallery Problem |
| URI | https://doaj.org/article/e38066e123774b7f818a7356c2ab2944 |
| Volume | 25:2 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Open Access Full Text customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: DOA dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVPQU databaseName: Continental Europe Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BFMQW dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.proquest.com/conteurope providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: M7S dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: BENPR dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content customDbUrl: eissn: 1365-8050 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012947 issn: 1365-8050 databaseCode: PIMPY dateStart: 19970101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED6hwgADjwKiPCoPXUNTOw9nLIgCQ6sMIJUpchwbkOhDTUHi33PnpKUbC6uTONF3se_OPn8fQCdGLyNcnR-VqwVahZ6yvvACq3qRFrTTJJ3YRDwayfE4STekvqgmrKIHroDrGiHRKxqcYDFQyWOLDkbFIow0VzlPAscE6sfJKpmq9w_wSlydxgsinshuMVnq8jrhpIi94X82aPqdPxkcwn4dCLJ-9QFHsGWmTThYiSywesw1YW-4JlYtj2HYZxXDkKZnP15nmNu_TRitprL09wwAI8sTZqZk2MawB3oTuyfllMU39uFkZE7geXD3dPvg1YoInuY-iSrmXGOEIlQSh0bkRehbHETSWqJRM7SHig45EcrmdKggD63AeRVjnJ7BvMUUSpxCYzqbmjNg1mBsIXsRN8IG2pdK2sJazIa4NUpFqgWdFU7ZvCK-yDBhcHBmDs6M4GzBDWG4voXYql0D2jCrbZj9ZcPz_-jkAnY5BhxUxsWDS2gsF5_mCnb01_K9XLTd79GG7fRxmL78AG7Kv6o |
| linkProvider | Directory of Open Access Journals |
| 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=A+Practical+Algorithm+with+Performance+Guarantees+for+the+Art+Gallery+Problem&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Simon+Hengeveld&rft.au=Tillmann+Miltzow&rft.date=2024-06-24&rft.pub=Discrete+Mathematics+%26+Theoretical+Computer+Science&rft.eissn=1365-8050&rft.volume=25%3A2&rft.issue=Discrete+Algorithms&rft_id=info:doi/10.46298%2Fdmtcs.9225&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_e38066e123774b7f818a7356c2ab2944 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon |